A polytope in 70 dimensions with 200 inequalities may have as many as 983858800923516812309510979394668240 vertices (by McMullen's upper bound theorem). Of course that number can also be much smaller. In general, there is no good way to tell ahead of time if such a computation is possible and how long it will take (if it is finished before our known universe will come to its end).

I should add: even if that number would be smaller, there is no algorithm known which computes the convex hull in polynomial time (measured in the combined size of the input and the output).

My best offer is a comprehensive set of tests documented in:

- Benjamin Assarf, Ewgenij Gawrilow, Katrin Herr, Michael Joswig, Benjamin Lorenz, Andreas Paffenholz and Thomas Rehn. Computing convex hulls and counting integer points with polymake. Math. Program. Comput. 9 (2017), no. 1, 1-38. doi:10.1007/s12532-016-0104-z

This should give you a (very vague) idea what can be computed within a reasonable amount of time.

See also

this thread; you will find more of the same in this forum.