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 17:06Victor MerckléVictor MerckléScore: 9,019Success
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 17:108,91584,000,33657,522,00016,475,00028,672stderr
2Sep 8, 2026 17:108,92383,267,62557,729,00016,340,00028,672stderr
3Sep 8, 2026 17:108,94088,875,58457,984,00016,221,00024,576stderr
4Sep 8, 2026 17:108,95383,454,70557,922,00016,393,00028,672stderr
5Sep 8, 2026 17:109,01983,398,33657,693,00017,170,00028,672stderr
6Sep 8, 2026 17:109,08683,838,33257,132,00018,288,00028,672stderr
7Sep 8, 2026 17:109,38987,066,54957,640,00020,294,0002,121,728stderr
8Sep 8, 2026 17:109,50587,486,03158,349,00020,550,0002,121,728stderr
9Sep 8, 2026 17:1010,015100,197,97764,329,00018,801,0002,117,632stderr