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 listSep 11, 2026 21:05Victor MerckléVictor MerckléScore: 3,498Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 11, 2026 21:083,46238,566,31027,582,0001,153,0002,117,632stderr
2Sep 11, 2026 21:083,47539,292,87527,720,0001,128,0002,117,632stderr
3Sep 11, 2026 21:083,49240,332,21127,858,0001,132,0002,117,632stderr
4Sep 11, 2026 21:083,49538,796,93827,879,0001,131,0002,117,632stderr
5Sep 11, 2026 21:083,49838,841,01627,905,0001,129,0002,117,632stderr
6Sep 11, 2026 21:083,55041,265,00328,321,0001,151,0002,117,632stderr
7Sep 11, 2026 21:083,55940,072,35928,414,0001,126,0002,117,632stderr
8Sep 11, 2026 21:083,57039,452,04728,617,0001,015,0002,117,632stderr
9Sep 11, 2026 21:083,58239,282,68728,605,0001,129,0002,117,632stderr