Codefest Hackathon 2022
Hackathon is one of the key competitions at SLIIT CODEFEST. This competition is organized under the tertiary category to focus on
enhancing the software development capabilities of undergraduates from state and private universities / institutes in Sri Lanka.
The competition is held in two rounds. All the groups who fulfill the eligibility criteria will be qualified for the first round.
The best 10 groups who will be selected from the first round will be qualified to compete at the final round. The best three groups
will be awarded cash prizes.
Team Size: Four members in a team
Eligibility:
All the contestants of a group must be undergraduates from a state university or any other higher education institute in Sri Lanka. All group members should be from the same university or institute. There should be four members in the group.
Technologies
The competitors have the freedom to select the technologies.

Rules and Regulations:
- The team members who will have resisted and participated the first round will only be allowed to participate the final round.
- Team members cannot be replaced with new members.
Registration Period: Open Now! (Check the registration page)
Number of Rounds : Only two rounds
Initial Round (On-Line) |
Date | To be Announced |
Problem definition | The groups are expected to prepare and submit a video about a software system. Guidelines will be provided after the application closing date | |
Selection process | Judges will conduct the evaluations to select the best 10 groups | |
Evaluation criteria | Evaluation criteria will be published in the web site after the application closing date | |
Special requirements (Optional) | ||
Final Round (On-Campus) |
Date | To be Announced |
Problem definition | Groups are expected to participate the 10 -12 hour Hackathon | |
Selection process | Judges will conduct the evaluations to select the best 3 groups for the awards | |
Evaluation criteria | Evaluation criteria will be explained at the competition | |
Special requirements (Optional) |