A timed competitive programming round. Ship correct, efficient solutions under pressure.
Part 1 is a pure algorithmic sprint. Teams work through a graduated problem set covering data structures, greedy reasoning, graphs and dynamic programming. Submissions are judged on correctness first and runtime second, with an ICPC-style penalty for wrong attempts. The top teams carry forward into the Cybersecurity Hackathon.
ICPC style (solves, then penalty)
Teams are ranked by problems solved, then by total penalty (submission time plus 20 minutes per rejected attempt).
Submit source code through the online judge. Any of C++, Java, Python or Go.
Released problems for this round.
A campus network is modelled as an undirected graph of relay nodes. Given the adjacency list and a source node, report the minimum number of hops needed to reach every other node, or -1 where no route exists.
Submission
Single source file. Standard input to standard output.
Updates automatically as scores are entered.
Leaderboard Last updated just now · last score change 11 Sept 2026
Null Pointers
TM-P1-0001
Segfault Society
TM-P1-0002
Byte Force
TM-P1-0003
Kernel Panic
TM-P1-0004
Race Condition
TM-P1-0005
Stack Smashers
TM-P1-0006
Zero Day Club
TM-P1-0007
Infinite Loop
TM-P1-0008
Rubber Duck Squad
TM-P1-0009
Merge Conflict
TM-P1-0010
No attachment — full statement above.
Simulate a fixed-capacity cache under a hybrid eviction policy that prefers least-recently-used entries but protects any key accessed at least k times in the current window. Report the eviction order.
Submission
Single source file. Must run within 2 seconds for n up to 200000.
No attachment — full statement above.