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 7, 2026 22:48Victor MerckléVictor MerckléScore: 4,126Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 7, 2026 22:514,00841,787,81228,770,0004,504,0002,117,632stderr
2Sep 7, 2026 22:514,09242,535,73629,607,0004,358,00024,576stderr
3Sep 7, 2026 22:514,10643,337,87629,725,0004,357,00024,576stderr
4Sep 7, 2026 22:514,11342,707,58229,721,0004,417,00024,576stderr
5Sep 7, 2026 22:514,12642,756,77229,887,0004,366,00024,576stderr
6Sep 7, 2026 22:514,13543,596,61329,909,0004,419,00024,576stderr
7Sep 7, 2026 22:514,15042,944,71729,739,0004,707,0002,117,632stderr
8Sep 7, 2026 22:514,15543,078,17629,916,0004,573,00024,576stderr
9Sep 7, 2026 22:514,16042,999,39629,636,0004,894,0002,117,632stderr