New location
The nibbles competition page has moved to BTH Game
programming wiki. These are the old pages and will not be updated
anymore.
Assembly nibbles competition
The nibbles tournament is about producing the smallest IA-32 assembly implementation
(measured in code + data size of the relocatable file) possible. It has been
given as part of the examination in the UNIX
programming and the performance optimization courses at BTH.
All-time top 5
| 1 |
Christian Lindblom, Roy Sandgren (2004) |
163 bytes |
| 2 |
Anders Olofsson, Ulrik Mikaelsson (2003) |
212 bytes |
| 3 |
Aron Nieminen (2006) |
220 bytes |
| 4 |
Magnus Hellfalk, Rickard Katz (2004) |
228 bytes |
| 5 |
Simon Kågström - lecturer (2003) |
276 bytes |
Fall 2006, UNIX programming
| 1 |
Thomas Herrlin |
387 bytes |
|  |
| 2 |
Kamanish Biswas, Shair Baz Shah |
398 bytes |
| 3 |
Mohammed Salih, Isaac Okunulele |
571 bytes |
Fall 2006, Performance programming
| 1 |
Aron Nieminen |
220 bytes |
|  |
| 2 |
Patrik Sjöberg |
309 bytes |
| 3 |
Eddie Willman, Magnus Gideryd |
318 bytes |
Fall 2005
| 1 |
Ge Zhang |
337 bytes |
|  |
| 2 |
Morgan Hallgren, Smirnov Sergey |
375 bytes |
| 3 |
Teddie Stenvi, Mattias Sandström |
940 bytes |
Fall 2004
| 1 |
Christian Lindblom, Roy Sandgren |
163 bytes |
|  |
| 2 |
Magnus Hellfalk, Rickard Katz |
228 bytes |
| 3 |
Fredrik Henricsson, Jörgen Nilsson |
359 bytes |
Fall 2003
| 1 |
Anders Olofsson, Ulrik Mikaelsson |
212 bytes |
|  |
| 2 |
Nils Forsman, Jimmy Persson |
508 |
| 3 |
Daniel Persson, Dejan Baca |
608 |
Reference (the lecturer, me)
X. Simon Kågström - 276 bytes