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 21:27Victor MerckléVictor MerckléScore: 3,555Success
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 21:283,51737,786,20328,164,0001,028,0002,117,632stderr
2Sep 8, 2026 21:283,54137,953,02428,381,0001,011,0002,117,632stderr
3Sep 8, 2026 21:283,54238,025,48128,376,0001,026,0002,117,632stderr
4Sep 8, 2026 21:283,54738,672,10628,435,0001,010,0002,117,632stderr
5Sep 8, 2026 21:283,55538,769,39328,498,0001,014,0002,117,632stderr
6Sep 8, 2026 21:283,55638,035,07528,507,0001,011,0002,117,632stderr
7Sep 8, 2026 21:283,57338,167,98528,646,0001,013,0002,117,632stderr
8Sep 8, 2026 21:283,57938,955,72328,677,0001,029,0002,117,632stderr
9Sep 8, 2026 21:283,58838,338,33028,770,0001,012,0002,117,632stderr