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 listAug 12, 2026 00:43Victor MerckléVictor MerckléScore: 6,081Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 12, 2026 00:486,05858,645,55449,259,0001,025,0002,117,632stderr
2Aug 12, 2026 00:486,06158,758,50249,287,0001,023,0002,117,632stderr
3Aug 12, 2026 00:486,06858,799,73149,360,0001,010,0002,117,632stderr
4Aug 12, 2026 00:486,07958,863,87349,448,0001,011,0002,117,632stderr
5Aug 12, 2026 00:486,08158,873,01349,445,0001,029,0002,117,632stderr
6Aug 12, 2026 00:486,10459,132,09849,581,0001,088,0002,117,632stderr
7Aug 12, 2026 00:486,12059,219,19449,793,0001,008,0002,117,632stderr
8Aug 12, 2026 00:486,17859,716,85950,197,0001,084,0002,117,632stderr
9Aug 12, 2026 00:486,27360,560,52751,043,0001,030,0002,117,632stderr