Parse integers Sergey Svistunov

Compute the sum of integers read from STDIN as fast as possible.

Input: 50 000 000 lines, each containing one integer in the range [0; 2147483647].

629871117
2024562523
1372689083
1021777120
2111176472

Output: The uint64 sum of all numbers, printed as a decimal string.

Note: Integer overflow is expected – use a 64-bit accumulator.

Back to listOct 2, 2026 18:49Karthik ReddyKarthik ReddyError
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 2, 2026 18:49045,300,47530,435,0005,799,00024,576expected "53684031050723672 ", got "popX 198318 popY 166224 | hotY 2540 | stream 30219 | coldY 3675 coldX 5776 | restX 78506 (x10ns) s1 "
2Oct 2, 2026 18:49045,354,74830,325,0006,013,00024,576expected "53688921729592069 ", got "popX 204388 popY 174168 | hotY 2493 | stream 30101 | coldY 3848 coldX 5648 | restX 80201 (x10ns) s1 "
3Oct 2, 2026 18:49045,008,32330,504,0005,407,00024,576expected "53683937122064316 ", got "popX 207396 popY 148388 | hotY 2179 | stream 30287 | coldY 3784 coldX 4569 | restX 70809 (x10ns) s1 "