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 29, 2026 01:02Victor MerckléVictor MerckléScore: 4,526Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 29, 2026 01:034,47645,527,59636,137,0001,019,0002,117,632stderr
2Aug 29, 2026 01:034,49745,694,84936,297,0001,029,0002,117,632stderr
3Aug 29, 2026 01:034,50345,703,77536,370,0001,007,0002,117,632stderr
4Aug 29, 2026 01:034,52145,883,23936,512,0001,018,0002,117,632stderr
5Aug 29, 2026 01:034,52645,916,24636,540,0001,026,0002,117,632stderr
6Aug 29, 2026 01:034,56046,820,47736,751,0001,103,0002,117,632stderr
7Aug 29, 2026 01:034,58146,381,10036,928,0001,097,0002,117,632stderr
8Aug 29, 2026 01:034,58747,099,43336,962,0001,113,0002,117,632stderr
9Aug 29, 2026 01:034,60147,706,81937,141,0001,053,0002,117,632stderr