marxist/project-euler — comment on commit 687fa2724f1001962a0bdb66c3ccbe48c3cb696d
File: 0001.lisp line 11
By marxist:

I've re-implemented the solution without push in a bit different way: marxist@f0a88a51a0fed2ca65cfbf678fe906b97e0dae04

Might seem inefficient, but I've decided not use a simple for-loop with modulo checks. I like the idea of loop-counter jumping between multiples (instead of incrementing by 1). Criticism wanted, of course.