Old program which is quite slow on new-disp

euler-10.raku

# Find the sum of all the primes below two million.
# real 0m22.322s
# user 0m22.272s
# sys  0m0.044s
# This is Rakudo version 2016.08.1-112-gbdd4691 built on MoarVM version 2016.08-32-ge52414d
use v6.c;
my int $max = 2_000_000;

# find all primes up to $max using The Sieve of Erathostenes
my int @a = (0..$max);

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

# remove discarded numbers and store the rest in a set for ease of lookup
my @primes = @a.grep(-> int $num {$num > 1});

say @primes.sum;