Post-Training Language Models for Gold-Medal Performance in Coding Competitions
On the map: LLM reasoning → Reasoning for agents, planning and code
Abstract (arXiv)
Competitive programming has become a key test of large language model reasoning, with international competitions such as IOI and ICPC representing its most challenging settings. We present an end-to-end specialization pipeline combining large-scale problem curation, synthetic reasoning traces, supervised fine-tuning (SFT), and reinforcement learning (RL). Using 22,000 curated problems, we train Nemotron-3-Nano-CC (30B-A3B) with SFT and RL and Nemotron-3-Ultra-CC (550B-A55B) with SFT alone. We further introduce GenCorrect, a feedback-driven test-time compute strategy that iteratively generates, evaluates, and refines diverse solutions. On IOI 2025, Nano-CC improves from 130 points to 291 after post-training and to 468 with GenCorrect, exceeding the gold threshold of 438.3 while Ultra-CC reaches 502. Guided by these results, we develop a competition-specific Ultra-CC system and evaluate it prospectively during IOI 2026. Under the same time, internet-access, and submission constraints as human contestants, it scores 535.4 out of 600, exceeding both the gold threshold of 361.12 and the top human score of 498.27. To our knowledge, this is the first AI system to outscore the highest-scoring human contestant on an IOI problem set.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Placed in Reasoning for agents, planning and code, one of 17 directions in LLM reasoning. Builds on 15 of its 25 references that are in the map. First posted on arXiv 2 Sep 2026.
Builds on
15 of 25 references.
Closest ancestors · 5
Same direction, newest first
- 2025OpenCodeReasoning-II: A Simple Test Time Scaling Approach via Self-Critique11 Jul
- 2025OpenCodeReasoning: Advancing Data Distillation for Competitive Coding2 Apr
- 2025S*: Test Time Scaling for Code Generation20 Feb
- 2024LiveCodeBench: Holistic and Contamination Free Evaluation of Large Language Models for Code12 Mar
- 2022Competition-Level Code Generation with AlphaCode8 Feb
Other references · 10
- 2024DeepSeekMath: Pushing the Limits of Mathematical Reasoning in Open Language Modelscited by 8,851
- 2025DAPO: An Open-Source LLM Reinforcement Learning System at Scalecited by 2,678
- 2024Scaling LLM Test-Time Compute Optimally can be More Effective than Scaling Model Parameterscited by 1,928
- 2023Large Language Models Cannot Self-Correct Reasoning Yetcited by 965
- 2026DeepSeek-V4: Towards Highly Efficient Million-Token Context Intelligencecited by 877
- 2025DeepSeek-V3.2: Pushing the Frontier of Open Large Language Modelscited by 755
- 2024Code Generation with AlphaCodium: From Prompt Engineering to Flow Engineeringcited by 100
- 2025Nemotron 3 Nano: Open, Efficient Mixture-of-Experts Hybrid Mamba-Transformer Model for Agentic Reasoningcited by 85
- 2026Nemotron 3 Ultra: Open, Efficient Mixture-of-Experts Hybrid Mamba-Transformer Model for Agentic Reasoningcited by 32
- 2025Scaling Test-Time Compute to Achieve IOI Gold Medal with Open-Weight Modelscited by 8
Built on by
Not cited yet.
Similar, not cited
Close in wording, no citation either way
- 2025Competitive Programming with Large Reasoning Models
- 2025ICPC-Eval: Probing the Frontiers of LLM Reasoning with Competitive Programming Contests
- 2025QueST: Incentivizing LLMs to Generate Difficult Problems
- 2025LLM-ProS: Analyzing Large Language Models' Performance in Competitive Problem Solving
- 2025CodeContests+: High-Quality Test Case Generation for Competitive Programming
- 2024Can Language Models Solve Olympiad Programming?
- 2025LiveCodeBench Pro: How Do Olympiad Medalists Judge LLMs in Competitive Programming?
- 2026X-Coder: Advancing Competitive Programming with Synthetic Tasks, Solutions, and Tests