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 13, 2026 18:37Victor MerckléVictor MerckléScore: 143,478Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 13, 2026 18:37143,2461,198,345,8071,187,821,0001,128,0002,117,632stderr
2May 13, 2026 18:37143,2961,198,767,6571,188,347,0001,010,0002,117,632stderr
3May 13, 2026 18:37143,3391,200,283,4441,188,582,0001,132,0002,117,632stderr
4May 13, 2026 18:37143,4071,197,768,0901,189,264,0001,019,0002,117,632stderr
5May 13, 2026 18:37143,4781,200,101,1311,189,663,0001,206,0002,117,632stderr
6May 13, 2026 18:37143,5361,199,846,0441,190,168,0001,182,0002,117,632stderr
7May 13, 2026 18:37143,5931,201,442,2601,190,703,0001,127,0002,117,632stderr
8May 13, 2026 18:37143,9611,202,846,3371,193,824,0001,056,0002,117,632stderr
9May 13, 2026 18:37144,0251,203,206,6741,194,375,0001,033,0002,117,632stderr