If your child is planning to apply for STEM majors and is looking for a free, beginner-friendly programming competition to build their skills, the USA Computing Olympiad (USACO) is worth a close look. A new USACO season is approaching, and this guide explains what the contest involves and lays out a realistic, step-by-step preparation plan for students starting with little or no programming experience. It is written for both students and parents.
Why STEM Applicants Consider USACO
A Recognized National Olympiad
USACO is the United States’ national olympiad in informatics (competitive programming). Each year it selects the four students who represent the USA at the International Olympiad in Informatics (IOI). MIT Admissions’ blog lists USACO as the US qualifying competition for the IOI. For students applying to computer science and other STEM fields, taking part in USACO is a concrete way to show sustained interest and ability in programming.
Open to Beginners
A common question is whether a student can take part without any programming background. They can. Anyone may register a free account and enter, and every new participant starts in the Bronze division, which is designed for students who are new to programming. There are no age or prior-coursework requirements to compete in the online contests.
Free to Enter, With Free Practice Resources
There is never any fee to participate in USACO contests, and the official site offers hundreds of hours of free training resources along with past problems and their solutions. Because the contest is built around algorithms and problem-solving rather than a fixed body of memorized material, a motivated student can make steady progress from one division to the next. How quickly depends on the student’s starting point and practice time. Reaching the top divisions is a significant undertaking, not a guaranteed outcome within a set number of months.
Skills That Transfer to University Study
USACO problems center on algorithms, logical reasoning, and writing correct code. These are the same foundations covered in introductory university computer science courses, so students who prepare for USACO often find it easier to adapt to the pace of college-level study in the field.
USACO Season Schedule and Rules
The competition is divided into four divisions, taken in order:
- Bronze: Entry level. Basic programming and simple logic, using techniques such as simulation, sorting, and brute force.
- Silver: Introductory algorithms, including greedy methods, binary search, prefix sums, and graph traversal (DFS).
- Gold: Intermediate algorithms, including dynamic programming, graph theory and shortest paths, and efficient data structures such as union-find.
- Platinum: The most advanced division. There is no fixed syllabus and no upper limit on difficulty; segment trees and advanced dynamic programming are typical.
Contest Format and Scoring
Each contest is open for a window of several days, and you take it in one continuous block of about four to five hours at a time of your choosing within that window. A contest usually has 3 problems worth roughly 333.33 points each, for a maximum of 1000 points, and each problem is graded on about 10 test cases. You may write your solutions in C, C++, Java, or Python. C++ is the only language allowed at the IOI and is the usual recommendation for the higher divisions, because some harder problems can be difficult to solve within the time limit in Python.
Season Dates (2025-26)
The season runs from January to March, with three online contests followed by the US Open championship:
- First contest: January 9-12, 2026
- Second contest: January 30 – February 2, 2026
- Third contest: February 20-23, 2026
- US Open: March 28, 2026
A few things are new this season. The US Open is now proctored and taken in person at designated sites rather than online. Gold and Platinum contestants who want a certified score must begin on the Saturday at 12:00 p.m. ET, when the problems are released (the Chinese sister site notes a roughly 15-minute start window). Platinum participants were also reset to Gold at the start of the season, a practice the organizers say they may continue.
Moving Up Between Divisions
Students advance one division at a time. Each contest sets its own promotion cutoff, and scoring above it moves you into the next division for future contests. In recent seasons, monthly-contest cutoffs have mostly fallen in the 650-750 range, though they vary from contest to contest. A perfect score of 1000 earns immediate promotion during the contest itself, so a student may go on to attempt the next division’s problems within the same window.
A Step-by-Step Preparation Roadmap
This plan is written for students starting with little or no programming experience, and it works through the divisions in stages. Treat the timing as flexible: some students move faster, others take longer, and consistent practice matters more than hitting a fixed schedule.
Stage 1: Foundations, Working Toward Silver
Core goal: learn basic Python syntax and begin thinking computationally.
Focus: variables, loops, conditional statements, arrays, strings, and basic input and output. Python is a good starting language here, since all Bronze-level problems are meant to be fully solvable in Python.
Stage 2: Introductory Algorithms, Aiming for Silver and Gold
Focus: sorting, enumeration, greedy algorithms, simple recursion, and basic search techniques.
Goal: get comfortable with common Silver-level problem types, build a set of reusable templates, apply the basic algorithms fluently, and work toward promotion to Gold.
Stage 3: Core Algorithms, Breaking Into Gold
Focus: dynamic programming, breadth-first search (BFS), depth-first search (DFS), hash tables, shortest paths, and introductory graph theory.
Goal: practice past Gold problems by topic, identify the patterns that come up most often, and build up problem-solving speed and debugging skill.
Stage 4: Preparing for Platinum
- Take full, timed mock contests using past papers, following the real four-to-five-hour format and pacing.
- Keep an error log and work systematically through your weaker topic areas.
- Refine your code for efficiency and watch for the common mistakes that cost test cases.
At this level, expect topics such as segment trees and advanced dynamic programming, and problems designed to be challenging even for strong competitors.
Free USACO Preparation Materials
Scan the QR code below for free practice problems, study guides, and past contest materials.