IOI prep, free.
The IOI is the world olympiad in programming for school students. Each country sends up to four students, who write C++ programs to solve hard algorithm tasks over two contest days.
For students and parents together. Powstik is for ages 13 and up. An under-18 account is private: it is never public and never ranked.
What is IOI?
The IOI is the world olympiad in programming for school students. Each country sends up to four students, who write C++ programs to solve hard algorithm tasks over two contest days.
Who takes it?
Secondary school students who like programming and hard problems, and the parents and teachers who support them.
What costs money?
The study plan here costs nothing. The test itself has a fee, set by IOI. The official site lists it.
How do I show my score?
Upload the score screen with ID numbers hidden. Someone who saw the real result confirms it.
What IOI is
- Set by
- IOI
- Who takes it
- Secondary school students who like programming and hard problems, and the parents and teachers who support them.
- Sections
- Competition Day 1 (Three tasks in 5 hours. Each task is worth 100 points, split into subtasks.); Competition Day 2 (Three new tasks in 5 hours, scored the same way.); Practice contest (A 2-hour practice contest before Day 1 to learn the system. It does not count.)
- Timing
- Two competition days, each with three tasks in 5 hours. A 2-hour practice contest comes first.
- Scoring
- Each task is worth 100 points, split into subtasks. A subtask scores only if every test in it passes (unless the task says otherwise). For each subtask your best score over all your submissions counts. A day's score is the sum of three tasks; medals go to about half of all contestants.
- How you take it
- On a computer at the contest site. You write C++ (compiled with GCC on Linux) and submit to CMS (Contest Management System), which runs your program on secret tests. You get subtask scores for each submission during the contest.
- Tools allowed
- C++ only, with the editors and documentation on the contest computer. Paper and pens are given. Your own books, notes, phones, watches and storage are not allowed. Up to 50 submissions per task, at most one a minute (except the last 15 minutes).
- Dates and fees
- On the owner's site: official dates, official fees.
Format read from the official IOI page on 2026-11-17. Formats change; the owner's page is always right.
The free plan
The study plan, the official practice, the best free help, your proofs and your Trophy Case are free. Work through the outcomes in order.
Before you upload a score screen or a score report, hide your registration, roll, application and ID numbers. Powstik never asks for an ID number. Someone who saw the real result confirms it: a teacher, counsellor, tutor or study partner. They are told to send back any proof that shows an ID number.
1. IOI: Mathematics
The maths that IOI tasks lean on: integers and divisibility, counting, logic and proof, and graphs and trees. You show it by writing code and by explaining in your own words why your idea is correct. Diagnostic, topic practice, timed problems and a review, with free material only.
- Try a first set of Mathematics problems
Show: Upload your own written attempts (scans or typed), marked by you as solved, partly solved or stuck, and a short note on where you got stuck.
- Study Mathematics topic by topic
Show: Upload a topic tracker (topic, problems tried, problems solved) and your own written solutions to at least two problems per topic.
- Solve timed Mathematics problems
Show: Upload your own written work from each timed session (at least three), with the date, the problems (contest, year, number) and the time taken.
- Review Mathematics and rewrite your best solutions
Show: Upload your review (misses by topic and by reason) and three clean solutions written by you. A confirmer who knows the subject checks that they are right and that they are yours.
- Try a first set of Mathematics problems
2. IOI: Programming Fundamentals
Writing correct C++ quickly: variables, loops, functions, arrays and strings, basic data structures and recursion. Every IOI task starts here. Diagnostic, topic practice, timed problems and a review, with free material only.
- Try a first set of Programming Fundamentals problems
Show: Upload your own written attempts (scans or typed), marked by you as solved, partly solved or stuck, and a short note on where you got stuck.
- Study Programming Fundamentals topic by topic
Show: Upload a topic tracker (topic, problems tried, problems solved) and your own written solutions to at least two problems per topic.
- Solve timed Programming Fundamentals problems
Show: Upload your own written work from each timed session (at least three), with the date, the problems (contest, year, number) and the time taken.
- Review Programming Fundamentals and rewrite your best solutions
Show: Upload your review (misses by topic and by reason) and three clean solutions written by you. A confirmer who knows the subject checks that they are right and that they are yours.
- Try a first set of Programming Fundamentals problems
3. IOI: Algorithms and Complexity
The heart of the IOI: choosing an algorithm and data structure that is fast enough, from greedy and dynamic programming to graph algorithms and segment trees, and judging its running time. Diagnostic, topic practice, timed problems and a review, with free material only.
- Try a first set of Algorithms and Complexity problems
Show: Upload your own written attempts (scans or typed), marked by you as solved, partly solved or stuck, and a short note on where you got stuck.
- Study Algorithms and Complexity topic by topic
Show: Upload a topic tracker (topic, problems tried, problems solved) and your own written solutions to at least two problems per topic.
- Solve timed Algorithms and Complexity problems
Show: Upload your own written work from each timed session (at least three), with the date, the problems (contest, year, number) and the time taken.
- Review Algorithms and Complexity and rewrite your best solutions
Show: Upload your review (misses by topic and by reason) and three clean solutions written by you. A confirmer who knows the subject checks that they are right and that they are yours.
- Try a first set of Algorithms and Complexity problems
4. IOI: Software Engineering
Turning an idea into a working program under time pressure: reading the task precisely, using the task's grader and API, testing your own code, debugging, and managing your five hours. Diagnostic, topic practice, timed problems and a review, with free material only.
- Try a first set of Software Engineering problems
Show: Upload your own written attempts (scans or typed), marked by you as solved, partly solved or stuck, and a short note on where you got stuck.
- Study Software Engineering topic by topic
Show: Upload a topic tracker (topic, problems tried, problems solved) and your own written solutions to at least two problems per topic.
- Solve timed Software Engineering problems
Show: Upload your own written work from each timed session (at least three), with the date, the problems (contest, year, number) and the time taken.
- Review Software Engineering and rewrite your best solutions
Show: Upload your review (misses by topic and by reason) and three clean solutions written by you. A confirmer who knows the subject checks that they are right and that they are yours.
- Try a first set of Software Engineering problems
5. IOI: Full timed papers
Sit full past papers for the IOI under real timing, review each one with an error log, and compare.
- Sit a full past paper, timed
Show: Upload your own written work from the sitting, with the date and the time taken, marked against the official answers. Never copy an official solution.
- Review the paper with an error log
Show: Upload your error log for the full paper and a short plan: your weakest subject area, the topics you will work on, and by when. Never post official questions, passages or solutions. Describe them in your own words.
- Sit a second full paper and compare
Show: Upload your own written work from the sitting, with the date and the time taken, marked against the official answers. Never copy an official solution. Add a short comparison of the two sittings: what moved, what did not, and why.
- Sit a full past paper, timed
6. IOI: Your national route
Find how your country picks its IOI team, and sit the first round. You cannot enter the IOI directly.
- Find your country's route
Show: Write a one-page route plan in your own words: your country's olympiad body (with its official link), each round in order, who may enter, and what you will do first. Do not include any ID number.
- Sit your first national round
Show: Upload your result from the round and a short write-up of what you learned. Hide your registration, roll, application and ID numbers first. Your confirmer must be a teacher, parent, tutor or study partner who saw the real result.
- Find your country's route
Official free practice
- Past IOI tasks, test data and solutions (IOI archive): Every IOI since 1989, each with its tasks, official test data and solutions. Write and test your own code first; open a solution only after a real attempt.
- IOI 2026 tasks, test cases and solutions: The latest IOI: two days of three tasks each, with the official test cases to check your own program and the official solutions to compare after.
- The IOI Syllabus: The official list of what IOI tasks may need: what is included, what is outside the focus and what is excluded. Use it to plan and to name each topic.
- IOI 2026 Contest Rules: The rules of the latest IOI: two days, three tasks a day, five hours, subtask scoring, C++ only, feedback and what you may bring.
- IOI 2026 grading environment: How your code is compiled and judged at the IOI: C++ on Linux, the exact compile command and the contest system. Set up your own computer the same way.
- IOI 2026 tasks page (practice tasks and task packages): The practice and contest tasks as contestants got them, with graders and compile scripts. Use them to learn the IOI way of submitting a function to a grader.
- IOI videos (task explanations): Task authors explain past IOI tasks. Watch one only after you have tried the task yourself.
- Getting started (IOI guide for beginners): The IOI's own advice: learn a programming language, practise algorithms, and work through past tasks. It also explains that teams come through a national competition.
The best free help
- USACO Guide: A free, well-ordered guide from first programs to IOI-level topics, with practice problems and solutions for each module.
- USACO past contests (test data and official analysis): Past contests of the USA Computing Olympiad at four levels, each problem with test data and an official analysis. Timed sets of three problems, like an IOI day.
- oj.uz: past IOI tasks with a free judge: Submit your own code for past IOI tasks and get subtask scores, as at the IOI. Free, but submitting needs an account (under 18: sign up with a parent).
- CSES Problem Set: Classic problems sorted by topic (introductory, sorting, dynamic programming, graphs, trees, mathematics). The judge checks your code; there are no written solutions.
- Competitive Programmer's Handbook (Antti Laaksonen): A free book on the author's own site covering what IOI tasks need: complexity, sorting, dynamic programming, graphs, trees, range queries and the maths behind them.
- Algorithms for Competitive Programming (cp-algorithms): Clear write-ups of standard algorithms and data structures, each with C++ code and practice problems.
- Codeforces EDU courses: Free lessons from ITMO University teachers on binary search, two pointers, disjoint sets and segment trees: video, theory, then practice problems with a judge.
- Discrete Mathematics: An Open Introduction (Oscar Levin): A free open textbook on logic, proofs, counting, sequences and graph theory, with exercises and many solutions.
- Mathematics for Computer Science (MIT OpenCourseWare 6.042J): MIT's free text and course on proofs, induction, number theory, graphs, counting and probability for computer science.
- LearnCpp.com: A free C++ tutorial from the basics to the standard library. IOI submissions are in C++, and the IOI's own guide links this site.
Go deeper
The test checks the field. Powstik Varsity teaches it, with free full courses in order.
Arena mode
Arena mode adds a study plan dated back from your own test date, a private score log and a weekly cohort. Everything else on this page stays open without it.
Trademark
IOI is a trademark of the IOI Foundation. Powstik is independent and not affiliated with or endorsed by the IOI Foundation.
Powstik links to official material and never copies its questions.