If you want to look at the JIT overhead, for the benchmark stone and Richards, multiply the first number by ten and subtract the second number. And you can do

If you want to look at the JIT overhead, for the benchmark stone and Richards, multiply the first number by ten and subtract the second number. And you can do it in your head, CPython is the fastest if you only going to launch the interpreter and run the program once. The sorting benchmark is more interesting. One could estimate where the breakeven point is, if considering the sorting scaling to be exactly n*log(n). Though the timings could be considerably different once everything fits in L2 or L1 cache.