Problem 10 asks us to find the sum of the prime numbers below 2*106. With the sieve() routine written for one of the earlier problems, this is easy: it becomes
> sum(sieve(2E6))
It is slow, however. It makes you appreciate how computationally intensive it is to search for larger primes.