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 9, 2026 13:07Victor MerckléVictor MerckléScore: 3,610Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 9, 2026 13:113,58538,102,10428,714,0001,049,0002,117,632stderr
2Sep 9, 2026 13:113,58738,129,56328,752,0001,028,0002,117,632stderr
3Sep 9, 2026 13:113,59038,482,03228,768,0001,030,0002,117,632stderr
4Sep 9, 2026 13:113,60339,186,98328,873,0001,035,0002,117,632stderr
5Sep 9, 2026 13:113,61039,323,45728,903,0001,065,0002,117,632stderr
6Sep 9, 2026 13:113,61239,322,75928,947,0001,033,0002,117,632stderr
7Sep 9, 2026 13:113,61438,556,18428,970,0001,034,0002,117,632stderr
8Sep 9, 2026 13:113,61538,597,34328,934,0001,071,0002,117,632stderr
9Sep 9, 2026 13:113,63639,430,41229,167,0001,017,0002,117,632stderr