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:25Victor MerckléVictor MerckléScore: 4,644Success
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:284,39945,696,29030,007,0006,509,0002,117,632stderr
2Sep 8, 2026 10:284,42547,214,58630,322,0006,412,0002,117,632stderr
3Sep 8, 2026 10:284,55146,269,67129,923,0007,851,0002,117,632stderr
4Sep 8, 2026 10:284,61746,768,50230,123,0008,199,00024,576stderr
5Sep 8, 2026 10:284,64447,001,35430,278,0008,275,0002,117,632stderr
6Sep 8, 2026 10:284,65147,743,49930,123,0008,481,0002,117,632stderr
7Sep 8, 2026 10:284,67547,625,55830,523,0008,286,00024,576stderr
8Sep 8, 2026 10:284,89349,034,86030,430,00010,184,0002,117,632stderr
9Sep 8, 2026 10:284,97249,797,40330,858,00010,413,0002,117,632stderr