10% faster

gistfile1.txt

# Find the sum of all the primes below two million.

use v6;
my int $max = 2_000_000;

# find all primes up to $max using The Sieve of Erathostenes
my int @a = 0..$max;
@a[1] = 0;  # don't include 1

for (2 .. ($max div 2)) -> int $i {
  my int $j = 2;
  @a[$i * $j++] = 0 while $i * $j <= $max;
}

say @a.sum(:wrap);