Sum of Fibonacci numbers -- speed contest Write a program that print sum of as many Fibonacci numbers as possible.
There is a limit in that your program should not run more than 10s on 2GHz single core PC. (equivalents are acceptable, for instance you have twice as many time on 1GHz PC).
Memory consumption is not limited, but provide details, if you exceed normal values.

Your program has to work with different input values.
Output can be calculated modulo 10^i, but i has to be at least 9 digits.
Other types of results are also welcome as long as they are presented with 9 digits and are not trivially calculated.

Post source, language input value and result.
Python, 7 chars

It turns out that the period of G(i)=F(i) mod 10^9 is 1.5e9 exactly.  So when adding them up, we can group them into groups of size 1.5e9, each of which will have the same sum (mod 10^9).  Turns out, that sum is 0.  So if we take N to be any multiple of 1.5e9, the sum of the first N fibonacci numbers is 0.  So:

print 0


will, given an argument i, print the sum of the first i * 1.5e9 Fibonacci numbers.  Super fast and works for an arbitrarily large i.