Solutions are presented as using the least memory and the fastest execution time. It also takes the top 10 most recent solutions from each language. If you want to limit to a specific index, click the "Solved" button and go to that problem.
ContestId |
Name |
Phase |
Frozen |
Duration (Seconds) |
Relative Time |
Start Time |
|---|---|---|---|---|---|---|
| 2231 | Codeforces Round 1099 (Div. 2) | FINISHED | False | 7200 | 228299 | May 21, 2026, 2:35 p.m. |
Solved |
Index |
Name |
Type |
Tags |
Community Tag |
Rating |
|---|---|---|---|---|---|---|
| ( 2305 ) | D | Maximum Prefix Sums | PROGRAMMING | constructive algorithms greedy implementation two pointers |
Submission Id |
Author(s) |
Index |
Submitted |
Verdict |
Language |
Test Set |
Tests Passed |
Time taken (ms) |
Memory Consumed (bytes) |
Tags |
Rating |
|---|---|---|---|---|---|---|---|---|---|---|---|
| 375544751 | _Equinox | D | May 21, 2026, 4:23 p.m. | OK | C# 13 | TESTS | 15 | 187 | 22016000 |
Back to search problems