Speed Debugging
Speed Debugging at SuperComp 2026: fix broken algorithms, then rescue two broken web repos from bug tickets. Two rounds, fully auto-judged, no AI.
Two rounds of fixing other people's broken code, judged entirely by hidden tests: single-file algorithms first, then two real web repos with bug tickets.
Programming · Team of 1–2 · 01:00 PM–04:00 PM · 3 hrs · Rs 1,500 entry · Rs 20K prize
How it works
- Round 1 · Bug Hunt (40 min): Ten short algorithm programs, each with one or two planted bugs: 4 easy (10 pts), 4 medium (20) and 2 hard (30), 180 points in all. C++17, Java 21 or Python 3. Change only what's broken: more than twice the bug count plus one changed lines is rejected as Too Many Changes.
- Break and reseat (20 min): Results go up and the top 20 teams move on.
- Round 2 · Repo Rescue (75 min): Two broken repos, a plain HTML, CSS and JS frontend and a Node.js backend, each with 8 bug tickets: 3 easy (10 pts), 3 medium (20) and 2 hard (40), 340 points in all. Every submit runs the full hidden test suite, so breaking something you'd fixed loses those points.
Setup
- Lab PCs in a locked exam browser, one PC per team
- The portal's web IDE, with a live preview and dev tools in Round 2
- Teams of one or two; bring only your student ID
Judging
- Fully automatic: hidden tests decide every point, with no judging panel.
- Round 2 decides the winner. Ties go to the earlier time to the final score, then fewer submissions, then the higher Round 1 score.
- Round 1 ties go to the lower penalty time (minutes to each fix, plus 5 minutes per rejected submission).
- Each round has a 10-minute dispute window; the faculty advisor rules on appeals.
Register for Speed Debugging · Rulebook · All Programming tracks
Registration, the countdown and site search need JavaScript turned on.