Fibonacci. You know it. You love it. You can't get enough of it.
You've seen the definition. You've seen the first few hundred. You've even stopped off at the millionth.
Prepare yourself for the majesty of the ten millionth Fibonacci number.
This sucker took around 31 hours of computation on a 1.67Ghz G4 PowerBook. It has 2,089,878 digits in base 10, and 433,902 in base 65,535 (which is what the computation was done in). It's 867,804 bytes (847.5KB) while in memory in base 65,535 form and a whooping 1.99MB in the ASCII base 10 representation.
It was calculated using my own bignum class written in C++ based on Knuth's work from Volume 2 of The Art of Computer Programming. The actual version of the source code used is linked here in all it's messy and likely inefficient and naive glory. I welcome feedback, verification, validation, or proof/evidence it is wrong.
(Yes, I know there are faster ways of calculating this than the classic addition algorithm, but I had fun doing it - and that's what counts, right?)
Without further ado... I give you: The 10,000,000th Fibonacci number!