Hello Codeforces!
Computer Coding Club, MNNIT Allahabad, India is glad to invite you to the annual programming competition of MNNIT, INSOMNIA, which is an ACM-ICPC style team programming contest of 3.5 hours duration held on Codeforces. The team can consist of up to 3 members.
Contest Details:
- Start Time: Saturday, April 11, 2026 at 14:00 IST (UTC+5.5)
- Team Size: Up to 3 Team Members
- This round is proctored, to be eligible for the prize money please follow the proctoring guidelines given at the end in the blog
CONTEST LINK
Prize Pool:
INR 26400
The Cash Prize Pool would be split between Top 3 Global Teams, Top 3 MNNIT Teams and Fastest Solver of Each Problem and following would be the split:
Note: International Payments are subject to international/local transaction rules and swift/wise payment system and incase of no possible payments option, equivalent gift card may be provided
Note for MNNIT Students: To be eligible for MNNIT Specific Prize Pool, all of your team members should be from MNNIT Allahabad
Registration
MNNIT Students need to fill out this Form
For Non MNNIT People, please fill this Contact Detail Form
Proctoring Guidelines
Note: We encourage participanting teams to follow the proctoring guidelines to be eligible for the prize pool, however no team would be removed from final standings because of non compliance to proctoring guidelines, these guidelines are there only ensure fair play for those contesting for the prize pool.
To ensure fair play and transparency during the Insomnia, all participants who are willing to be eligible for the Prize Pool are required to record their screen, video of them attempting the contest, and microphone audio throughout the 3.5-hour contest using OBS Studio.
Please refer to these guidelines to make sure you are prepared to submit the videos after the contest.
It's important to record the screen as well as the physical presence of each team member (eg. if all three of you are using same system, then you need to provide 1 screen recording and 1 video of you attempting together, however if you are having all 3 members in different locations then it's important to provide 3 different screen recordings and 3 physical presence videos and so on)
Submit the Videos Here (Responses to this form would be opened 30 minutes before the ending time of contest and would be closed 2 hours after the end of contest)
Big Thanks To
- Problem Setters: ayushman18, aryan_lem, sushmit2022, uday51, Utsav_Kasvala, aditya1977, rky_cse
- Testers: sssilent_coder, aman.vns003, depun078, sushmit2022, aditya1977, uday51
Special Thanks to MikeMirzayanov and KAN for the amazing Codeforces and Polygon Platforms!!
We have an exciting problemset awaiting you. Good Luck and Have Fun!!
UPD1:
Thanks to all participants for joining Insomnia 2026, We hope you all enjoyed the problem set!!
The final rankings for Global Top 3, MNNIT Top 3 and Fastest Submissions were decided out of the teams which had submitted the videos, the videos were verified and checks were made to ensure there is no fair play violation, if found, such instances were documented by us, after careful analysis we have settled on following result:
Global Top 3
- Global First : El-Coach Tooor ICPC por favor (Hamed_, _Sherbiny, Kareem_Elgoker)
- Global Second: Cuca codeas? (Edu175, MarcosK)
- Global Third: The Good, The Bad and the Ugly (Baskot, MEDAAA, Baraa-Ahmed)
MNNIT Top 3
- MNNIT Rank 1 : int32_t (aditraj2004, late_night_dreams, NPsolved.cpp)
- MNNIT Rank 2 : Funner's Paradise (aachintyaW, ashish20jha08, AadiJain558)
- MNNIT Rank 3 : TheWinners (mnnit.prakharg)
Fastest Submissions (Out of those whose videos were submitted and can be verified for fair play)
- A: mt19937 (rohitsomani, dangiyatharth9, emni_o)
- B: El-Coach Tooor ICPC por favor (Hamed_, _Sherbiny, Kareem_Elgoker)
- C: El-Coach Tooor ICPC por favor (Hamed_, _Sherbiny, Kareem_Elgoker)
- D: The Good, The Bad and the Ugly (Baskot, MEDAAA, Baraa-Ahmed)
- E: Cuca codeas? (Edu175, MarcosK)
- F: El-Coach Tooor ICPC por favor (Hamed_, _Sherbiny, Kareem_Elgoker)
- G: Cuca codeas? (Edu175, MarcosK)
- H: Cuca codeas? (Edu175, MarcosK)
- I: int32_t (aditraj2004, late_night_dreams, NPsolved.cpp)
- J: ACSepted (slowzone, Ceilings, Siddarth_MSR)
Note: The results are final and binding, for any disagreements teams may write to [email protected]
Congratulations to all winners!! The prize pool disbursement details and procedure will be shared with Winning Teams via mail soon
UPD2:
The Editorial has been prepared for Insomnia 2026 — Editorial
Regards,
Computer Coding Club, MNNIT Allahabad
Auto comment: topic has been updated by sushmit2022 (previous revision, new revision, compare).
Auto comment: topic has been updated by sushmit2022 (previous revision, new revision, compare).
Auto comment: topic has been updated by sushmit2022 (previous revision, new revision, compare).
Auto comment: topic has been updated by sushmit2022 (previous revision, new revision, compare).
Auto comment: topic has been updated by sushmit2022 (previous revision, new revision, compare).
As a participant, I guarantee my participation.
As an incoming participant, I guarantee that everyone will solve a non-negative number of problems.
Excited for the contest
cfbr
Удачи составителям задач! С нетерпением жду контеста!
Удачи составителям задач! С нетерпением жду контеста!
I guarantee nothing, but I will be there...
Highly excited for the contest.
We hope you guys have a great time with these problems! Good luck, can't wait to see you all on the leaderboard!
Some exciting problems await you, hope you all enjoy it
Ready to question my entire coding journey after attending Insomnia. Hope to solve at least one.
Ready to get traumatized by the problem statements and lose whatever self-respect I have left.
Got traumatized by the wrong problem statements
i didnot thought midnight code and this contest clashes with each
As a tester, I can assure you that you’re going to love the contest.
As a tester, I guarantee that the problems exist.
As a testing ground for random shit, I can try my best to keep this contest in recent actions :))))
During Contest can we search on google and use code from sites like GFG, USACO, CP Algorithm etc.
We have added the related details under "Code of Conduct" on page 3 of the guidelines.
Why is Choose Team dropdown box is not showing my team to register. I have already registered couple of days ago. I have also received mail regarding the registration
please drop a mail at [email protected] with a screenshot of the issue, we will connect there to resolve this for you
did it get resolved?
yes sir resolved , thank you for your assistance
Well, didn't see this line. Too bad our team won't claim the prize for the first solve of the problem G.
The contest was overall good. I find it very lengthy and implementation heavy (definitely not for a single person).
Problem A was good : The condition that every element is increasing with constant speed and all the elements and their upper bound is distinct simplified it otherwise the implementation would have been very messy.
Problem B was just copy pasting mat-expo template (thanks to my clion ai-enabled auto-complete)
Problem D was very boring like I knew that we can get array A by SA (copied it from cp-algorithm) and now it's just implementing what written after getting A using ordered set.
Problem F was good (I knew the idea before, seen it in offline indian contest back in 2019-2020, most probably in MNNIT or IIITA contest). I felt the idea was forced on a tree like somehow the author wanted to fit the identity that sum(Ai * Aj) is (sum(A))^2 — sum(A^2) / 2 in problem.
Problem G would have been very boring without the M condition. I came up with binary search in like 5 mins but most of the time went to incorporate the M condition in my greedy parititioning logic. After some greedy failures, dp was easy to figure out.
Problem I : This was good div2 B/C.
Gave a college round after 6 years. I was able to perform decent because the ideas were mix of multiple old ideas with very heavy implementation.
Could you please share solution to question B.
Let f(n) be the number of arrays with length n.
f(0) = 1 (empty array) f(n <= y) = x^n (you have x choices for every index and since length of array is not more than y thus you are free to put anything you want)
for n > y , let's say the last contiguous block of element has length k (where k can go from 1 to y). We have (x-1) choices for the element corresponding to the last block (it should be different from previous element) thus,
f(n > y) = Sum((x-1) * f(n-k)) for k from 1 to
Since the (x-1) is constant , it can be easily done using mat-expo in O(y^3 * log(x))
Thank you for the solution , helps a lot.
irdk why yall had so tighter bounds a was easily solvable with segtrees but still you had to adopt fenwick tree to solve it
Auto comment: topic has been updated by sushmit2022 (previous revision, new revision, compare).