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 18:22Victor MerckléVictor MerckléScore: 3,648Success
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 18:253,60038,418,06728,869,0001,016,0002,121,728stderr
2Sep 8, 2026 18:253,63639,070,90729,146,0001,034,0002,121,728stderr
3Sep 8, 2026 18:253,63838,718,72729,157,0001,045,0002,121,728stderr
4Sep 8, 2026 18:253,64839,152,27829,247,0001,035,0002,121,728stderr
5Sep 8, 2026 18:253,64839,143,47929,235,0001,045,0002,121,728stderr
6Sep 8, 2026 18:253,66738,857,81229,385,0001,054,0002,121,728stderr
7Sep 8, 2026 18:253,67439,414,33029,465,0001,033,0002,121,728stderr
8Sep 8, 2026 18:253,67838,929,47629,507,0001,027,0002,121,728stderr
9Sep 8, 2026 18:253,68539,121,40729,487,0001,099,0002,121,728stderr