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 12:24Victor MerckléVictor MerckléScore: 3,565Success
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 12:283,54039,212,42128,260,0001,122,0002,117,632stderr
2Sep 14, 2026 12:283,55339,395,06628,347,0001,147,0002,117,632stderr
3Sep 14, 2026 12:283,55439,246,96928,375,0001,131,0002,117,632stderr
4Sep 14, 2026 12:283,55639,393,91528,380,0001,137,0002,117,632stderr
5Sep 14, 2026 12:283,56540,329,15328,443,0001,153,0002,117,632stderr
6Sep 14, 2026 12:283,58240,278,05928,560,0001,177,0002,117,632stderr
7Sep 14, 2026 12:283,59640,401,62328,738,0001,112,0002,117,632stderr
8Sep 14, 2026 12:283,62139,955,23128,918,0001,137,0002,117,632stderr
9Sep 14, 2026 12:283,64040,225,00429,086,0001,130,0002,117,632stderr