The IOI awards roughly the top eighth of the field a gold medal, the next sixth silver and the next quarter bronze, which means gold is shared by around fifty contestants. Placing third within that gold band is a much narrower achievement than the medal alone suggests. It requires solving problems that the other forty-odd gold medallists could not fully solve, in the same ten hours, with the same time limits and memory limits.
Each contestant sits two five-hour rounds of three problems, and the tasks are scored by subtask rather than pass or fail. In practice this rewards a specific temperament. A contestant who insists on the full solution to a hard problem may finish the round with less credit than one who banks the reduced cases first and then attacks the general problem with what is left. Consistently landing in the top handful means getting that allocation right on both days, not one.
China's informatics programme is built to produce exactly this. Provincial olympiads feed a national olympiad; the national olympiad feeds a selection camp with its own contest series; only four contestants emerge. By the time a Chinese contestant reaches an international final, the format holds no surprises — the difficulty of the problems does, but not the shape of the day. That structural advantage explains the country's consistency at the top of the standings, and it also explains why two of its four contestants finished in the world's top three in 2026.
The 2026 field was the largest the olympiad has hosted in recent years, with 375 contestants representing 92 countries and territories. Alongside the Chinese golds, Chinese Taipei's Li Po-ting placed eighth, Ukraine's Vladislav Khalin sixteenth, and Vietnam's Nguyen Huu Tuan took gold in a team that finished eighth overall. The competition ran from 9 to 15 August, hosted by Uzbekistan in Tashkent.
It is worth being precise about what a placing like this does and does not prove. It does not measure originality, taste in problems, or the patience required to work on something for a year rather than five hours. It measures the ability to recognise the structure of a well-posed algorithmic problem faster and more completely than almost anyone else of the same age on earth, under examination conditions. That is a genuine and rare capacity, and it is also a narrow one.
The olympiad's public statistics archive records every contestant, every score and every medal awarded since the first edition in 1989. Zhao Shenghao's third place is in that archive, alongside the alumni who went on to research careers, to the teams that build compilers and distributed systems, and to the many who did something else entirely. The record is durable; what follows from it is not decided by the record.
| Person | Country | Milestone | Age / Stat |
|---|---|---|---|
| Xu Qiwen | 🇨🇳 China | 1st overall — 498.27 points | Gold |
| Zhao Shenghao | 🇨🇳 China | 3rd overall | Gold |
| Team China | 🇨🇳 China | 1st in the team standings | 3 gold, 1 silver |
| Field | — | 375 contestants, 92 countries and territories | — |
Gold at the International Olympiad in Informatics is shared by around fifty contestants; third place in the world is shared by one. Zhao Shenghao produced the third-best score on earth across two five-hour examinations against the strongest teenage algorithmists from 92 countries, and did it in the same team as the contestant who finished first. The placing is recorded in the olympiad's permanent public archive.
Discover More Child Prodigies
50+ stories of contemporary young geniuses changing chess, music, science, and art.
Explore All Prodigies →


