Contests
Ongoing contests
| Contest | Users | |
|---|---|---|
Sample (Tutorial) Contest Open-ended | 85 |
Upcoming contests
Past contests
| Contest | Users | |
|---|---|---|
Week 4: Prefix Sums 1 hour, 40 minutes long | 28 | |
Week 3: Greedy Algorithms 1 hour, 30 minutes long | 25 | |
Week 2: Standard Library Datastructures 4 hours long | 44 | |
Week 1: Intro to Competitive Programming 2 hours long | 51 | |
MCPC 2025 Div B 4 hours long | 12 | |
MCPC 2025 Div A 4 hours long | 9 | |
Week 5: Intro to Geo 1 hour, 40 minutes long | 8 | |
Week 2: Shortest Path Algorithms 7 hours, 59 minutes long | 10 | |
Week 1: Introduction to Dynamic Programming 7 hours long | 13 | |
Reverse Contest 1 hour, 54 minutes long | 13 | |
Week 11: Disjoint Set Union 7 hours, 59 minutes long | 7 | |
Week 10: Segment Trees 2 hours long | 5 | |
Week 9: Dijkstra's Algorithm 7 hours, 41 minutes long | 8 | |
Week 7: Sliding Windows 2 hours long | 7 | |
Week 6: Introduction to Dynamic Programming 7 hours long | 13 | |
2025 S1 Beginner Competitionrated 3 hours long | 62 | |
MCPC 24rated 5 hours long | 26 | |
Week 9: Lowest Common Ancestor 8 hours, 49 minutes long | 10 | |
Week 8: Minimum Spanning Tree 2 hours long | 10 | |
Week 6: Reverse Contest 2 hours long | 11 |