> To avoid dealing with very large numbers, assume that we're computing our answer modulo a large prime.

Or tool up and get a better programming language?

This is not about the programming language. Arbitrary-size integers make complexity analysis much more nuanced because arithmetic operations are no longer constant time.