www.mikescher.com/www/statics/euler/Euler_Problem-002_explanation.md

Also the problem here was not the algorithm, but writing and compressing it in Befunge. The code calculates the Fibonacci sequence one after each other and remembers the sum while iterating.