4 ms·

It's intentionally using the naive 2^N solution to stress test lots of tiny function calls.

• dhruvdh 4y ago
  There is no way it will take a whole second regardless. Even when compiled in debug mode, it takes about 100 ms. Try it here, I had Bing AI write it out - https://play.rust-lang.org/?version=stable&mode=release&edition=2021&gist=fb977f063a167c6d347e10d302b5fad2 https://play.rust-lang.org/?version=stable&mode=release&edit...
  • estebank 4y ago
    OP isn't talking about the performance of Rust code to calculate fib(35), but rather the performance of a Rust implementation vs a Zig implementation of an interpreted language executing code to calculate fib(35). They are saying that the Rust VM they wrote is slower than the Zig VM they wrote.
    • munificent 4y ago
      And, in particular, an interpreted dynamically typed language.
      • jeffdn 4y ago
        From a book that was a real joy to read and take one’s first steps into the magical world of compilers —- thank you for writing it!
        • munificent 4y ago
          You're welcome! I'm glad you liked it.
  • deleted 4y ago
    [deleted]