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 06:10Victor MerckléVictor MerckléScore: 4,065Success
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 06:143,52646,149,67328,244,0001,023,00024,576stderr
2Sep 8, 2026 06:143,56238,654,09328,528,0001,038,00024,576stderr
3Sep 8, 2026 06:143,98842,029,92828,846,0004,260,00024,576stderr
4Sep 8, 2026 06:144,06242,158,59128,006,0005,710,00024,576stderr
5Sep 8, 2026 06:144,06542,966,58228,887,0004,860,0002,117,632stderr
6Sep 8, 2026 06:144,08543,005,02028,549,0005,357,00024,576stderr
7Sep 8, 2026 06:144,13343,389,69328,224,0006,086,0002,117,632stderr
8Sep 8, 2026 06:144,23545,027,54129,031,0006,125,0002,117,632stderr
9Sep 8, 2026 06:145,14651,128,42128,426,00014,287,00024,576stderr