I added an interesting metric to the Fibonacci calculator implemented in C++, Java, Go, Haskell, Lisp, and Rust. Pay attention to the last column: it's the number of CPU cycles required to calculate the 32nd Fibonacci number. The difference between different implementations and languages is so huge.
Would be great if you can contribute and add implementations in other compiled languages, maybe Kotlin or sometime more exotic like Self of Smalltalk.
Also, there is a bug with rust/recursion — it's optimized too much :) Maybe you know how to fix?
