I finished my Pizza Rolls, but still felt like ticking a few more off these off the list. Project Euler Problem 10 just asks us to sum all the primes < 2,000,000. Pretty simple stuff. Using the prime sive from a previous problem, we add a little padding, then just sum an array of numbers we found to be primes. Could have while()'d the cache hash for the sum, but the cost of maintaining the array is pretty trivial, I think the resulting code is cleaner, and I'm really tired of these stupid prime number problems.
Solution below.
