← Back to all articles

Competition Guides

British Informatics Olympiad: From School Paper to International Team Selection

How the first round, Cambridge final and IOI pathway work—and how students should prepare

19 Aug 202611 min read
Article cover image

Editorial overview

The British Informatics Olympiad is unusual among school competitions because its first round combines accessibility with a very high ceiling. An eligible school can enter students without a previous qualifying result, and the three-hour paper can award useful credit for partial solutions. Yet the same paper is the first selection stage for a residential final at Churchill College, Cambridge, from which Britain’s international informatics teams are chosen. The competition therefore asks beginners and future international contestants to work on the same style of task, separated by algorithmic insight, efficiency and implementation reliability.

That structure should shape preparation. BIO is not a test of how many programming-language features a student remembers, and it is not an app-building showcase. A contestant must turn an unfamiliar specification into an algorithm, read constraints, write and test a program, and explain parts of the reasoning in writing. The school-based format also creates an administrative dependency: a teacher coordinates entry, supervises the paper, marks it using the official scheme and submits results. CompeteMap’s view is that BIO is an excellent destination for students who already enjoy both coding and mathematical problem solving, but a poor choice for learning syntax under contest pressure. Students should use the extensive official archive to build from correct small cases toward efficient full solutions, while schools should confirm the current year’s rules early. As of 8 September 2026, the organiser had reported the completed 2026 final but had not yet published a 2027 competition page.

Quick Facts

FieldDetails
CompetitionBritish Informatics Olympiad (BIO)
OrganiserBritish Informatics Olympiad
Typical studentsUnder-19 students in full-time pre-university education in mainland Britain, entered through a school or college
FormatThree-hour programming paper in school, followed by an invitational final in Cambridge
Best forStudents who can implement algorithms independently and enjoy reasoning from constraints
DifficultyVery demanding at the top end, although partial solutions make the first round useful to a wider range of prepared programmers

Review Evaluation

Rated Expert. BIO has a light formal entry requirement but expert skill demand, long-term preparation and a mature, multi-part output. Its final functions as national selection and can lead to international representation, so success depends on sustained algorithmic practice rather than short-term familiarisation.

What BIO is—and what it is not

The British Informatics Olympiad is Britain’s national school programming competition and has run since 1995. The latest published cycle, BIO 2026, described three stages: a first-round test in schools, a final at Churchill College, Cambridge, and selection of teams for international competitions. The final took place from 3 to 5 April 2026.

BIO is centred on competitive programming. Each problem defines inputs, required outputs and constraints; the student must discover a method and implement it correctly. This differs from product competitions, where user research, interface design or a pitch may be central. It also differs from short computational-thinking quizzes that do not require students to build complete programs.

The first round remains useful even for students who are not yet close to the final. Its subproblems and mark scheme can reward a correct approach to smaller cases. That makes the paper a diagnostic tool: it shows whether a student’s main limitation is reading, algorithm design, complexity, coding accuracy or testing.

Eligibility and school entry

The 2026 rules opened BIO to students under 19 in full-time secondary or further—but not higher—education in mainland Britain. A school or college staff member acts as the teacher in charge and completes the entry. Students do not enter the British route independently.

The geographic wording matters. The organiser points students in Northern Ireland and the Republic of Ireland toward separate national competitions. A student aiming for an international team should follow the selection route for the country or territory they are eligible to represent, rather than assume that any English-language informatics olympiad feeds into the same team.

The latest published first-round window ran from 8 December 2025 to 23 January 2026, with marks due shortly afterwards. Those dates are now past. Schools planning for the next cycle should monitor the official BIO website and wait for the new rules rather than copying the 2026 timetable.

The three-stage pathway

Stage 1: the school paper

For 2026, the first round was a three-hour paper with three programming questions supplemented by written problems. Students could use any type of computer and any programming language. Their answer comprised program files, written responses and the results of tests specified in the mark scheme.

The teacher in charge marked the work using the organiser’s scheme and submitted the marks electronically for final consideration. This is not the same as an unsupervised online judge session. Schools need a three-hour sitting, a reliable way to retain programs and written work, and enough time to complete the marking and submission process.

Stage 2: the Cambridge final

Strong first-round performers are invited to the final at Churchill College, Cambridge. The general BIO overview describes about 15 finalists, while the current year’s rules should be treated as definitive because the number and additional selection arrangements can change. The final uses longer and more standardised programming conditions than the school paper.

The published 2026 rules specified Linux PCs and C/C++ for the final. A student can therefore use another language in round one, but anyone aiming seriously at progression should become comfortable with the final environment before an invitation arrives.

Stage 3: international selection

The top four eligible finalists form Britain’s team for the International Olympiad in Informatics, subject to the year’s rules. BIO results also contribute to selection for the European Girls’ Olympiad in Informatics and the Western European Olympiad in Informatics. This international role explains why the upper end of the competition is so demanding: the final is not merely an awards event but a national-team selection process.

What the first round tests

BIO problems change from year to year, so a syllabus checklist is less useful than a set of recurring behaviours:

  • translating a precise specification into a program;
  • identifying what the input constraints allow;
  • finding patterns, invariants or useful state representations;
  • choosing between simulation, search, greedy reasoning, graphs, dynamic programming and other methods;
  • producing a correct simpler solution before attempting an optimisation;
  • testing edge cases and explaining reasoning clearly.

Constraints are part of the problem. A brute-force program may be correct on small inputs and unusable on large ones. Students should learn to estimate time and memory before coding, then compare that estimate with the bounds in the question.

Written work also matters. A student who can make code pass familiar examples but cannot explain an algorithm or justify its behaviour has an incomplete contest skill set. The official past papers and mark schemes are valuable because they show how programs, test results and written answers interact.

How to prepare with the official archive

The organiser maintains an extensive archive of BIO problems, and its information pack directs students to recent sample papers and marking schemes. BIO Helper provides browser-based judging and model material for many older round-one tasks. Use these resources as a progression rather than a library to read passively.

1. Make one language dependable

Students should be able to handle input and output, strings, arrays, functions, sorting, sets or maps, recursion and basic debugging without searching for every line of syntax. Reliability in one language is more useful than shallow familiarity with several.

2. Solve the smallest correct version first

If a full method is not visible, write a brute-force or simulation solution for small cases. Record its complexity and identify the precise constraint that makes it insufficient. This mirrors the partial-credit structure and often reveals the route to an optimisation.

3. Review by failure type

After each problem, label the main obstacle: misunderstood statement, missing algorithm, wrong complexity, implementation bug or weak testing. The next practice session should address that category. Simply counting solved problems can hide a repeated weakness.

4. Re-implement after reading

When a mark scheme or model solution is needed, close it and rebuild the method independently. Then alter examples and create adversarial cases. A solution is learned only when the student can explain why it works and where a simpler approach fails.

5. Add timed papers gradually

Begin untimed, then use single-problem sessions, and finally complete a full three-hour paper. Review time spent on reading, planning, coding and debugging separately. A student who repeatedly codes too early needs a different correction from one who finds the algorithm but cannot implement it.

A twelve-week preparation outline

WeeksMain focusEvidence of progress
1–3Language reliability and careful testingShort programs work on edge cases without extensive repair
4–6Complexity, search, greedy methods and common data structuresThe student can compare two approaches before coding
7–9Past BIO problems and partial solutionsSmall-case methods are correct and improvements are justified
10–11Full timed papersTime allocation and submission discipline become repeatable
12Error repair and consolidationPreviously failed problems can be solved again without notes

This is a framework, not a prescribed syllabus. A student who struggles with arrays and indexing should repair that foundation before adding advanced graph algorithms.

What schools should arrange

Because the first round is school-coordinated, students should approach a Computing, Mathematics or ICT teacher well before registration closes. The school needs to know:

  • who will act as teacher in charge;
  • where the full three-hour sitting can take place;
  • which computers and languages will be available;
  • how program files, test output and written answers will be retained;
  • who will mark the work and submit results;
  • whether the school has an earlier internal expression-of-interest deadline.

If the school is new to BIO, the student can share the official information pack and past paper archive. A specific request to register and supervise the first round is easier to act on than a general request to create an olympiad programme.

Common mistakes

Learning syntax instead of algorithms

More language features do not compensate for a weak model of the problem. Students should spend deliberate time deciding what information the program must represent and how the method scales.

Ignoring partial credit

Waiting for a perfect full solution can produce no working code. A correct smaller method provides marks, test evidence and a base for improvement.

Practising only with an automatic judge

Round one includes written material and teacher marking. Students should use official papers and schemes, not only platforms that return “accepted” or “wrong answer”.

Delaying the final environment

Another language may be appropriate in the first round, but the latest published final rules used Linux and C/C++. A progression-focused student should not leave that transition until Easter.

Treating an old timetable as current

The 2026 cycle is complete, and the next competition page had not been published when this article was checked. Eligibility, dates, finalist numbers and technical arrangements should be confirmed from the new rules each year.

Where BIO fits in the UK pathway

BIO occupies the algorithmic and selection-focused end of UK school computing. UK Bebras can introduce computational thinking without requiring full program implementation, while project competitions focus more on building and presenting a product. None is a mandatory qualifier for BIO; they develop different evidence and skills.

See UK Computing Competition Pathway Explained for the wider landscape, or use Bebras vs Raspberry Pi Foundation Coding Challenge vs British Informatics Olympiad to compare formats directly. Students who prefer team-based theory and programming rounds may also find the American Computer Science League guide useful, subject to its own entry arrangements.

Key Takeaways

  • BIO is a school-entered programming competition and the principal British route to international informatics team selection.
  • The latest published first round was a three-hour, three-question paper combining programs, test evidence and written answers.
  • Partial solutions matter, so students should build a correct simple method before optimising.
  • Progression-focused students need both algorithmic reasoning and reliable implementation; the latest final rules specified Linux and C/C++.
  • Schools have real administrative responsibilities for registration, supervision, marking and result submission.
  • The 2026 cycle is complete. Check the official site for the next rules rather than reusing past dates or arrangements.

Sources checked

EXPLORE NEXT

Not sure where to start?

Find the right competition
View all articles →

Comments

Join the conversation

Share a question, note, or update.

No comments yet.