Problem Setters for IICPC Codefest'26

Revision en1, by abhijain565aj, 2025-07-02 18:48:38

We’re excited to announce that problem setting is now open for the prestigious IICPC Codefest 2026, one of India’s leading competitive programming contests supported by top global quant firms.

What is IICPC?

The IICPC is a collective of like-minded students from premier institutions such as IITs and top programmers across India. Our mission is to empower aspiring coders by fostering a culture of excellence in programming and problem-solving.

At IICPC, we conduct intensive coding camps designed to equip participants with the skills and knowledge needed to excel in competitive programming and software development. These camps not only provide valuable learning experiences but also culminate in certifications that validate participants’ expertise and dedication.

Here's our website to know more about us: IICPC

Upcoming Events

  • Quantfest 2025 Know more
  • Codefest 2026 Stay tuned and follow us on LinkedIn to receive the latest updates!

If you are passionate about creating high-quality, thought-provoking problems and want to contribute to an event that attracts the brightest programming minds across the country, this is your opportunity!

Compensation Structure

  • $800 USD / INR 70,000 for a full Codeforces Div-2 equivalent round (7 problems).
  • Compensation is flexibly distributed based on the difficulty level of the problems.
  • You will be recommended to global quant firms recruiting from the event.

We value creative, original, and challenging problems that can inspire the next generation of competitive programmers.

Interested? Please fill out the form carefully and join us in building something impactful: Click here

IICPC Codefest 2025 Statistics

  • 17000+ Registered Participants
  • 400 Regionalists
  • 50 Onsite Finalists
  • All the sponsors recruited students either full-time/interns

IICPC Codefest 2025 Memories

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en1 English abhijain565aj 2025-07-02 18:48:38 2632 Initial revision (published)