| 1 | Januszewski | Paweł | Kraków | 385 |
| 2 | Tancer | Martin | Prague | 350 |
| 3 | Kiss | Demeter | Budapest/ Amsterdam | 320 |
| 4 | Dinew | Sławomir | Kraków | 315 |
| 5 | Kuben | Jaromír | Brno | 313 |
| 6 | Burger | Michal | Bratislava | 309 |
| 7 | Kynčl | Jan | Prague | 300 |
| 8 | Dinew | Żywomir | Kraków | 296 |
| 9 | Csóka | Endre | Budapest | 293 |
| 10 | Byszewski | Jakub | Kraków | 291 |
| 11 | Stankevičius | Andrius | Vilnius | 283 |
| 12 | Strenner | Balázs | Budapest | 275 |
| 13 | Podbrdský | Pavel | Prague | 269 |
| 14 | Konopecký | František | Prague | 268 |
| 15 | Harrer | Daniel | München | 267 |
| 16 | Dorobisz | Krzysztof | Kraków | 266 |
| 17 | Bella | Peter | Prague | 263 |
| 18 | Budáč | Ondrej | Bratislava | 261 |
| Pilipczuk | Michał | Warsaw | 261 | |
| Zalewski | Mikołaj | Kraków | 261 | |
| 21 | Czajka | Tomasz | Warsaw | 259 |
| 22 | Roland | Paulin | Budapest | 256 |
| 23 | Wojtaszczyk | Jakub | Warsaw | 251 |
| 24 | Simančík | František | Oxford | 246 |
| 25 | Jankó | András György | Szeged | 245 |
| 26 | Stefaniak | Marcin | Warsaw | 244 |
| 27 | Pilipczuk | Marcin | Warsaw | 243 |
| 28 | Hamacher | Paul | Bonn | 223 |
| 29 | Kala | Vítězslav | Prague | 218 |
| 30 | Dražić | Goran | Zagreb/Bremen | 212 |
| 31 | Baronov | Emil Rumenov | Sofia | 211 |
| Závodný | Jakub | Oxford | 211 | |
| 33 | Lukić | Milivoje | Belgrade | 205 |
| 34 | Skórzewski | Paweł | Poznań | 203 |
| Adamaszek | Michał | Warsaw | 203 | |
| 36 | Terpai | Tamás | Budapest | 200 |
Red marked competitors can still participate next year.
Algorithm
Denote by P(s,y,c,p) the number of points obtained by student s in year y, category c, problem p. Let C(y) be a multiplicative coefficient corresponding to a particular year. We put C(y) = 10 for y < 2000 and C(y) = 100 for y greater than or equal to 2000. The criterion T(s) for sorting students is
According to this criterion, student can obtain 100 T-points in one year.