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 1, 2026 17:28Karthik 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 1, 2026 17:29036,732,29826,613,0001,118,0002,113,536expected "53686136245531866 ", got " 421492 54096 299488 596976 999 95460152 93780864 1903 53686136245531866 "
2Oct 1, 2026 17:29036,736,57926,564,0001,127,0002,113,536expected "53685805471074000 ", got " 456596 49248 248168 533444 999 95369660 93670236 1964 53685805471074000 "
3Oct 1, 2026 17:29036,615,93626,578,0001,129,0002,113,536expected "53691276962481274 ", got " 373828 58324 292956 583464 999 95413932 93804876 1896 53691276962481274 "