Runs faster with expr-jit turned off

euler-12.raku

# What is the value of the first triangle number to have over five hundred divisors?

use v6;
my $numFactors = 500;
my $sum = 0;
for (1...*) -> $term {
  $sum += $term;
  my $factors = (1..floor(sqrt($sum))).grep( -> $x { $sum % $x == 0} ).elems * 2;
  $factors-- if floor(sqrt($sum)) == sqrt($sum);
  if $factors > $numFactors {
    say "$sum";
    last;
  }
}