---
title: "GenCluster Crashes the Gold Medal Club at Coding's Hardest AI Benchmark"
subtitle: "A research team demonstrates that open-weight models can hit IOI gold with a reproducible test-time compute pipeline built on generation, clustering, and tournament ranking."
url: "https://alphasignal.ai/news/gencluster-crashes-the-gold-medal-club-at-coding-s-hardest-ai-benchmark"
author: "AlphaSignal Newsroom"
author_url: "https://alphasignal.ai/editorial-team"
company: "NVIDIA AI"
company_url: "https://alphasignal.ai/company/nvidiaai"
published: "2026-04-14T00:00:00.000Z"
updated: "2026-08-23T23:21:45.245Z"
type: "Paper"
topics:
  - "Reasoning"
  - "Benchmarks"
subtopics:
  - "Test Time Compute"
  - "Math Reasoning"
upvotes: 4500
source_url: "https://arxiv.org/abs/2510.14232"
comments: 0
truncated: true
---

# GenCluster Crashes the Gold Medal Club at Coding's Hardest AI Benchmark

> A research team demonstrates that open-weight models can hit IOI gold with a reproducible test-time compute pipeline built on generation, clustering, and tournament ranking.

A group of researchers has published a paper showing that an open-weight language model can reach gold medal territory at the International Olympiad in Informatics (IOI), the annual competition long treated as the ceiling for algorithmic reasoning in AI. Their framework, [GenCluster](https://arxiv.org/abs/2510.14232), wraps `gpt-oss-120b` in a four-stage test-time compute pipeline and reaches a score high enough for gold at IOI 2025, which they claim is a first for open-weight systems.

Until now, every publicly announced gold-medal IOI performance came from proprietary systems whose methodology was largely undisclosed. OpenAI reported gold at IOI 2024 with its o1-ioi and o3 models using specialized test-time compute approaches, and later claimed gold at IOI 2025, but the recipe was never published. This paper releases a fully specified approach that anyone with sufficient compute can reproduce.

## The gap the paper is trying to close

IOI is not a leaderboard you win by prompting harder. At IOI 2025, contestants face six problems, each divided into 2–12 subtasks, with strict time and memory constraints. Each problem allows a maximum of 50 submissions, making submission strategy an essential factor in performance. That cap is the crux of the challenge: a model can generate thousands of candidate solutions, but only a tiny fraction can be submitted for grading.

Prior large-scale test-time compute work like AlphaCode 2, which surpassed 85% of Codeforces participants by scaling up to 1M solutions and refining the selection mechanism, established the generate-then-select pattern. Those systems used proprietary models, and existing selection strategies designed for math problems (where majority voting usually finds the right answer) fall apart on IOI-difficulty tasks where correct solutions are rare.

_Preview only. Full text requires an AlphaSignal Pro account._

## Sources

- [Scaling Test-Time Compute to Achieve IOI Gold Medal with Open-Weight Models](https://arxiv.org/abs/2510.14232)
- [GenCluster paper HTML (arXiv)](https://arxiv.org/html/2510.14232)
- [NVIDIA-NeMo/Skills recipes on GitHub](https://github.com/NVIDIA-NeMo/Skills/tree/main/recipes)
- [IOI 2025 Results](https://stats.ioinformatics.org/results/2025)