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:41Victor MerckléVictor MerckléScore: 4,111Success
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:443,89640,767,16028,689,0003,654,0002,117,632stderr
2Sep 8, 2026 10:444,00541,708,04228,938,0004,304,00024,576stderr
3Sep 8, 2026 10:444,00841,702,40629,035,0004,234,0002,117,632stderr
4Sep 8, 2026 10:444,02042,541,25929,151,0004,221,0002,117,632stderr
5Sep 8, 2026 10:444,11143,109,98828,766,0005,356,00024,576stderr
6Sep 8, 2026 10:444,14242,884,25128,970,0005,416,00024,576stderr
7Sep 8, 2026 10:444,15143,488,05128,755,0005,706,00024,576stderr
8Sep 8, 2026 10:444,17643,151,53328,857,0005,811,00024,576stderr
9Sep 8, 2026 10:444,31044,469,73828,614,0007,166,0002,117,632stderr