ACSL Divisions Guide: Junior, Classroom, Elementary

Choosing between the ACSL divisions is the single most consequential decision a coordinator makes about this competition, and getting it wrong wastes an entire season for a student.

The five divisions, and the three that matter at Class 6 to 8

The ACSL divisions run at increasing difficulty across the American Computer Science League. Three are relevant to a middle school student.

Junior targets middle and high school learners, and no student beyond grade 9 may compete in it. It includes programming problems.

Classroom is open to students in all grades and is short-answer only, using the non-programming problems drawn from the Junior, Intermediate and Senior divisions.

Elementary is open to grades 3 to 6, is non-programming, and focuses each test on a single category of content.

Above these sit Intermediate, for high school students with little or no programming experience and advanced junior high students, and Senior, for high school students with programming experience.

The rule that decides it

One question settles the choice between ACSL divisions: does the student write code yet?

If not, they belong in Classroom or Elementary, and that is not a lesser option. The non-programming divisions test real computer science theory, and a student can score strongly on number systems and boolean algebra without ever opening an editor.

If they do write code, Junior is the right level through Class 8 and remains available through grade 9. Putting a non-programmer into Junior means they lose the programming problem in every one of the four contests, which is a quarter of the season thrown away.

Four contests, not one examination

This structure is ACSL's main advantage for a school and it changes how a year is planned.

Each season is divided into four contests, testing fundamental computer science concepts ranging from number systems to boolean algebra to digital electronics. Scores accumulate, so a weak first contest is not decisive and students see themselves improving across a year.

At the end of the season the top students are invited to compete in an online Finals.

For a computing department, that means a year-long activity with a published topic list rather than a single date to prepare for. It is far easier to sustain and far easier to timetable.

What ACSL actually tests

Unlike the logic contests, ACSL names its topics and tests them directly, which makes preparation concrete rather than general.

Number systems — binary, octal, hexadecimal, conversion and arithmetic across bases. Students find this most unfamiliar at first and it becomes routine quickly.

Boolean algebra and digital electronics — truth tables, identities, simplification and logic gates. This is how a computer actually works, and most school curricula never touch it.

Prefix, infix and postfix notation — converting between notations and evaluating expressions, a classic category appearing almost every season.

Graphs, trees and data structures, plus informal reasoning about which algorithm is faster.

That last point is worth dwelling on. A student who has only done Scratch has written programs without ever meeting the theory underneath them. ACSL supplies exactly that layer.

The programming problem

For divisions that include one, each contest adds a problem to be solved by writing a short program in Python, C++ or Java.

These are not large programs. They are specification-driven problems where the difficulty is understanding exactly what is being asked and handling edge cases, which is good discipline and closer to real software work than most contest programming.

Our ACSL Junior and Classroom course teaches this from the ground up in Python, so a student does not need to arrive already knowing a language.

For schools: how entry works

A teacher or coach registers as an advisor and enrols school teams. Registration for the 2026-27 season opened on 1 September.

Because scoring is team-based and the season runs across four contests, ACSL suits a school wanting a sustained activity rather than a single event. Because the categories are published in advance, a teacher can plan lessons against them rather than guessing.

Team tiers, billing and fee structure are set by ACSL and change, so confirm the current arrangements at acsl.org before committing a cohort.

How ACSL compares with the logic contests

Depth and duration. Bebras and the Beaver Computing Challenge are single 45-minute logic contests with no programming and no named syllabus.

ACSL runs four contests across a season, tests named computer science topics directly, and in most divisions includes real programming. It is the natural next step after the logic contests rather than a competitor to them.

A sensible progression for a school is Bebras and the BCC in Class 6 and 7, ACSL Classroom in Class 7 and 8, and ACSL Junior once students are coding.

Where it leads

What a contest actually looks like

Knowing the shape of a single contest helps a coordinator judge whether it fits a timetable.

Each of the four contests is short: a set of short-answer problems drawn from the published categories, plus a programming problem in the divisions that include one. It is written in school under supervision and does not need a long block in the way a three-hour olympiad does.

That brevity is why ACSL fits a normal school week. Four short contests across a year is a smaller timetable imposition than one long paper, and it keeps the activity visible rather than letting it vanish until exam season.

Where ACSL leads

ACSL continues through Intermediate and Senior divisions into the senior school years, so a student can stay within the same competition for six years while the difficulty rises around them.

Alongside it, students move towards national computing olympiads — INOI in India, and USACO internationally — where full algorithmic programming is required and the theory ACSL taught becomes assumed background.

Divisions, season structure, dates and fees are set by ACSL each year. Confirm the current details at acsl.org.