A hopelessly optimal case for the JIT compiler

calculate.nqp

#!/usr/bin/env nqp

# From https://www.johnhawthorn.com/2018/02/playing-with-ruby-jit-mjit/

sub calculate(int $a,  int $b, int $n) {
    my int $i := 0;
    my int $c := 0;
    while $i < $n {
        $a := $a * 16807 % 2147483647;
        $b := $b * 48271 % 2147483647;
        if ($a +& 0xffff == $b +& 0xffff) {
            $c := $c + 1;
        }
        $i := $i + 1;
    }
    return $c;
}

nqp::say(calculate(65, 8921, 40_000_000));