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 26, 2026 21:28Victor MerckléVictor MerckléScore: 3,971Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 26, 2026 21:293,94741,161,87731,661,0001,106,0002,117,632stderr
2Aug 26, 2026 21:293,95541,866,13831,704,0001,123,0002,117,632stderr
3Aug 26, 2026 21:293,95641,897,93531,725,0001,117,0002,117,632stderr
4Aug 26, 2026 21:293,96141,842,42531,725,0001,158,0002,117,632stderr
5Aug 26, 2026 21:293,97141,365,95931,851,0001,111,0002,117,632stderr
6Aug 26, 2026 21:293,97441,307,25731,841,0001,150,0002,117,632stderr
7Aug 26, 2026 21:294,00142,745,22132,105,0001,105,0002,117,632stderr
8Aug 26, 2026 21:294,20343,901,97433,785,0001,106,0002,117,632stderr
9Aug 26, 2026 21:294,21043,288,92433,896,0001,049,0002,117,632stderr