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 24, 2026 20:11Victor MerckléVictor MerckléScore: 3,881Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 24, 2026 20:123,81240,125,63330,471,0001,175,0002,117,632stderr
2Aug 24, 2026 20:123,83040,159,63130,726,0001,067,0002,117,632stderr
3Aug 24, 2026 20:123,87240,304,41130,981,0001,159,0002,117,632stderr
4Aug 24, 2026 20:123,87540,544,84831,082,0001,084,0002,117,632stderr
5Aug 24, 2026 20:123,88140,973,29131,198,0001,019,0002,117,632stderr
6Aug 24, 2026 20:123,88640,699,87631,117,0001,137,0002,117,632stderr
7Aug 24, 2026 20:123,93740,870,05431,577,0001,103,0002,117,632stderr
8Aug 24, 2026 20:124,00241,640,53932,153,0001,068,0002,117,632stderr
9Aug 24, 2026 20:124,06242,118,00732,567,0001,153,0002,117,632stderr