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 8, 2026 10:53Victor MerckléVictor MerckléScore: 4,318Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 8, 2026 10:564,13543,459,87230,275,0004,049,0002,117,632stderr
2Sep 8, 2026 10:564,19544,544,67630,583,0004,239,0002,117,632stderr
3Sep 8, 2026 10:564,28244,028,10729,780,0005,763,0002,117,632stderr
4Sep 8, 2026 10:564,29444,701,28829,948,0005,699,0002,117,632stderr
5Sep 8, 2026 10:564,31844,310,98230,148,0005,693,0002,117,632stderr
6Sep 8, 2026 10:564,32144,326,23630,633,0005,238,0002,117,632stderr
7Sep 8, 2026 10:564,51546,641,18330,465,0007,016,0002,117,632stderr
8Sep 8, 2026 10:564,72048,305,08929,923,0009,259,0002,117,632stderr
9Sep 8, 2026 10:564,73448,424,81129,942,0009,356,0002,117,632stderr