Comment by f33d5173

The python example is the pure naive recursive algorithm. It isn't meant to itself be optimized, but rather unveil the capacity of the interpreter. The raku code is, of course, unreadable gibberish, but I assume it contains some basic optimizations. At that point, it's unsurprising it performs better and in fact the runtime is somewhat embarassing, though probably comparable to the performance of a similar algorithm in python.