Skip to content
News · Opportunities

ACM 2026 programming/algorithmic contest on 8 November: national stage

Algorithms, programming and teamwork: UPT students can compete in teams of three at ACM, the national stage in the international ICPC circuit. Registration and preparation resources are available online.

Published
2 November 2026
Category
Opportunities
Reading time
1 min

Students of Politehnica University of Timișoara can take part on Sunday, 8 November 2026, in the Romanian Collegiate Programming Contest (ACM), the national stage of the international ICPC university programming competition, also known as ACM.

Participation at UPT takes place in person, with a local schedule of 09:00-15:00. The competition focuses on algorithmic thinking, problem solving and teamwork.

Teams and registration

Teams consist of 3 members, all students of Politehnica University of Timișoara, regardless of their year of study.

Teams register by completing the participation form.

Competition format

According to the information provided for participation at UPT, the contest involves solving 13 programming and algorithmic problems within 5 hours. The 09:00-15:00 interval is the announced local schedule for UPT participants, distinct from the contest duration.

No single programming language is compulsory. C++ is recommended for preparation because of its execution speed and the algorithms available in its standard library. Supported languages and technical participation requirements should be checked in the competition rules.

Preparation resources

Contact

For further information, students can contact the UPT coordinator, lecturer Dr Cătălin Iapă, at catalin.iapa@upt.ro.

Participation offers students an opportunity to test their algorithmic skills and teamwork alongside university teams from across Romania.

See all announcements

Registry notices, academic calendars and opportunities open to students are published as they are approved. Checking the section regularly is the way to keep up with current deadlines and procedures.

Was this page useful?

Report a problem