public long Solve()
{
var sieve = new AtikinSieve();
// TODO use prime-counting function to lower the upper bound
var primes = sieve.Search(200000);
return(primes.ElementAt(10001 - 1));
}
public long Solve()
{
var sieve = new AtikinSieve();
return(sieve.Search(2000000).Sum());
}
