4 ms·

I think it's the O(log n) algorithm that uses matrix exponentiation to find out the n'th Fibonacci number.