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 14, 2026 03:24Victor MerckléVictor MerckléScore: 4,272Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 14, 2026 03:244,23344,884,00834,069,0001,071,0002,117,632stderr
2Sep 14, 2026 03:244,23744,950,26434,086,0001,088,0002,117,632stderr
3Sep 14, 2026 03:244,23945,659,22834,109,0001,081,0002,117,632stderr
4Sep 14, 2026 03:244,25845,828,70534,269,0001,073,0002,117,632stderr
5Sep 14, 2026 03:244,27245,921,16834,380,0001,083,0002,117,632stderr
6Sep 14, 2026 03:244,27345,942,12834,417,0001,052,0002,117,632stderr
7Sep 14, 2026 03:244,39546,156,76035,397,0001,088,0002,117,632stderr
8Sep 14, 2026 03:244,39946,939,62635,374,0001,145,0002,117,632stderr
9Sep 14, 2026 03:244,40748,914,33835,481,0001,103,0002,117,632stderr