I’ve been doing the Project Euler problems again. They are pretty fascinating. I’ve already solved the first 15 (in Python, of course). Solving the 16th problem would be hard in any language other than Python. The problem is to “find the sum of the digits in 2^1000”. 2^1000 is an enormous number, much to big for a standard int, long, or double datatype. Thankfully Python has arbitrary precision integers out of the box. To see my solution, check out my github.