This is a simple but effective way to work out what Euler's 1st problem is. The problem is: Find the sum of all the multiples of 3 or 5 below 1000. If you run it in turbo-speed (Edit, Set Single Stepping, Turbo Speed) then the whole thing works out in about 2 seconds.
