Find the number of primes in [2, LIMIT] (LIMIT is currently defined as 8192), N times. The algorithm used is a naive implementation of the Sieve of Eratosthenes. This tests the efficiency of several constructs: arrays, loops, and integer math.
Source: [Sieve.im sieve.cpp
Output: The number of primes (1028).