Problem Format:
Participants are given a set of algorithmic problems, similar to competitive programming challenges.
Each problem has a defined optimal solution in terms of time and space complexity.
Participants must implement the optimal approach using assembly language.
Allowed Architectures:
ARM Assembly
MIPS Assembly
The supported instruction set and simulator will be announced before the event.
Resource Efficiency Criteria:
Solutions are evaluated on the following resource metrics:
Instruction Count
Register Usage
Memory Accesses
Control Flow Efficiency (branching, looping)
Programs that are correct but use unnecessary resources will receive lower scores.
Evaluation Criteria:
Each solution is evaluated using the following order:
Correctness (mandatory)
Algorithmic Optimality
Total Instruction Count
Register and Memory Efficiency
Execution Time (used only as a tiebreaker)
Failure to produce correct output results in zero score for that problem.
Tools & Environment:
Participants must bring their own systems with pre-installed Linux based operating systems.
Internet access and external references may be restricted.
All submissions are evaluated manually and/or benchmarked under identical conditions.
Rules & Fair Play:
Only assembly language is permitted.
High-level languages, code generators, or macros are not allowed.
Teams must not share code or solutions.
Any form of misconduct results in disqualification.
Amendments & Authority:
The organizing committee reserves the right to modify:
Problem statements
Scoring weights
Resource benchmarks
All decisions by the organizers are final.
Note
Participants are requested to bring their own extension boxes for power supply.
