IIMOC × FrontierCS 2026
International Math Optimization Challenge
IIMOC is a global Math/CS competition centered around hard optimization problems — accessible to motivated high school and college students, but deep enough for weeks of research. For 2026, teams compete across a frontier of algorithmic tasks from FrontierCS. Points are awarded by final placement on each task's leaderboard — the higher you rank when submissions close, the more points your team earns.
Apr 15
Practice problems released
May 1
Competition opens at 4 PM PST
June 1
Submissions close
June 10
Results released
Partners
IIMOC relies on partnerships to make tough, high-quality contests possible.
How It Works
Many Problems
A curated set of FrontierCS tasks (not just one problem). Teams can specialize, explore, and iterate.
Placement Scoring
Points are awarded by final rank on each task. Submit your best solution before the deadline and lock in your placement.
Reproducibility
We’ll encourage standardized evaluation via FrontierCS’s tooling (so results are comparable and auditable).
Rank-Based Points
The higher you place across all tasks, the more points you earn. Consistent top placements win the overall leaderboard.
We will release complete rules nearer to contest start date.
FrontierCS content is used with permission; FrontierCS remains the original source of the tasks.
2025 by the Numbers
209
Teams
Competing from top universities and clubs globally.
9,549
Submissions
Total iterative optimizations across the 4-week window.
Where Clubs Compete
21 countries in 2025
🇺🇸 USA🇯🇵 Japan🇰🇷 Korea
🇹🇼 Taiwan🇲🇦 Morocco🇨🇦 Canada
🇪🇹 Ethiopia🇬🇧 UK🇨🇳 China
🇮🇳 India🇮🇷 Iran🇵🇰 Pakistan
🇳🇱 Netherlands🇩🇪 Germany🇻🇳 Vietnam
🇵🇱 Poland🇶🇦 Qatar🇫🇮 Finland
🇭🇰 Hong Kong🇪🇬 Egypt🇧🇭 Bahrain
2025 Problems
Permutation (Sample)
Author: Qiuyang Mang (Sua)
Edited by: Edwin Chen
Editorial by: Alexander Du
Prepared by: Alexander Du & Edwin Chen
Polyomino Packing
Author: Shang Zhou (Berkeley Sky Computing Lab)
Edited by: Shang Zhou
Editorial by: Shang Zhou
Prepared by: Edwin Chen