Finding n-th Fibonacci number in x86 assembler (gist.github.com)

Indeed, it's nothing special. I just casually submitted it without any expectations. Sorry for disappointing you upon clicking the link.

I found the comments to be the most interesting section of the page

Perhaps the title should mention that it's done in a mere 15 bytes of assembler:

"; size: ; 15 bytes"

So it's a code-golf sort of thing.