The IOI is the oldest and most selective of the international science olympiads in computing. Each participating country or territory may send at most four contestants, all of them secondary-school students, and the national selection processes that produce those four are themselves multi-stage tournaments running for most of a year. In 2026 that filter produced 375 contestants from 92 countries and territories. Finishing first in that field is not a matter of being quick; it is a matter of being the person who saw the intended solution to the hardest problem on the paper.
The competition format explains why the winning score is a decimal rather than a round number. Tasks are broken into subtasks with separate constraints, and a contestant who solves a reduced version of a problem banks partial credit. Over six problems and ten hours, the totals separate contestants very finely. A score of 498.27 out of a nominal 600 means Xu solved the large majority of what was set, including parts of problems that most of the field could only approach.
China's team finished first in the overall standings with three gold medals and one silver. Team-mate Zhao Shenghao took third place in the individual ranking, meaning two of the top three finishers in the world came from the same four-person squad. That concentration is a feature of how the Chinese informatics pipeline works: provincial olympiads feed a national selection, the national selection feeds a training camp, and the camp produces contestants who have already sat dozens of five-hour rounds under competition conditions before they ever reach an international final.
What separates a leaderboard winner from the rest of the gold medallists at this level is rarely raw coding speed. All of them can implement a segment tree or a flow algorithm from memory. The difference is problem selection under time pressure — recognising within the first hour which of the three tasks is tractable and which is a trap, and being willing to abandon a promising line that will not finish. Ten hours of that judgement, spread over two days, is what the final score measures.
The 2026 olympiad was hosted by Uzbekistan and staged in Tashkent, in the country whose medieval scholar al-Khwarizmi gave the word algorithm to the language. The symbolism was noted at the opening; the competition itself was as it always is, a silent hall of teenagers and terminals. Results were announced at the closing ceremony on 15 August and are recorded in the olympiad's permanent public statistics archive, which lists every contestant, score and medal since 1989.
A first place at the IOI is a durable credential. The alumni list of past winners and gold medallists reads as a roster of research computer science and of the engineering teams behind large-scale systems; the competition is one of the few reliable early signals in a field where talent is otherwise hard to identify before university. What it does not do is settle anything. Xu Qiwen is a secondary-school student who was better than everyone else in the world at a specific, difficult, ten-hour task on two days in August.
| Person | Country | Milestone | Age / Stat |
|---|---|---|---|
| Xu Qiwen | 🇨🇳 China | 498.27 points — 1st place overall | Gold |
| Zhao Shenghao | 🇨🇳 China | 3rd place overall | Gold |
| Li Po-ting | 🇹🇼 Chinese Taipei | 8th place overall | Gold |
| Vladislav Khalin | 🇺🇦 Ukraine | 398.32 points — 16th place | Gold |
The International Olympiad in Informatics is the closest thing computing has to a world championship for people under nineteen, and its scoring is fine-grained enough that first place is not a tie-break or a coin toss. Xu Qiwen was ahead of 374 of the best teenage algorithmists on earth across ten hours of examination. The result is a matter of official record in the olympiad's public statistics archive, not a claim made on his behalf.
Discover More Child Prodigies
50+ stories of contemporary young geniuses changing chess, music, science, and art.
Explore All Prodigies →


