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 listMay 22, 2026 09:11Victor MerckléVictor MerckléScore: 12,048Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 22, 2026 09:1411,960108,751,72598,137,0001,137,0002,117,632stderr
2May 22, 2026 09:1411,963107,649,06798,169,0001,127,0002,117,632stderr
3May 22, 2026 09:1412,006107,482,32998,542,0001,108,0002,117,632stderr
4May 22, 2026 09:1412,013109,397,93898,603,0001,108,0002,117,632stderr
5May 22, 2026 09:1412,048109,550,77698,887,0001,116,0002,117,632stderr
6May 22, 2026 09:1412,101108,221,71599,335,0001,107,0002,117,632stderr
7May 22, 2026 09:1412,176110,573,97799,945,0001,120,0002,117,632stderr
8May 22, 2026 09:1412,250112,260,295100,639,0001,043,0002,117,632stderr
9May 22, 2026 09:1412,302111,450,241101,063,0001,044,0002,117,632stderr