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 11, 2026 20:35Victor MerckléVictor MerckléError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 11, 2026 20:35095,888,17384,000,0001,006,0002,113,536expected "53682129464696539 ", got "53682129464440539 "
2May 11, 2026 20:3510,22894,310,37383,797,0001,100,0002,113,536
3May 11, 2026 20:3510,22995,404,85783,802,0001,099,0002,113,536
4May 11, 2026 20:3510,23094,085,38183,804,0001,106,0002,113,536
5May 11, 2026 20:3510,24193,761,92483,814,0001,191,0002,113,536
6May 11, 2026 20:3510,24695,019,58184,040,0001,005,0002,113,536
7May 11, 2026 20:3510,24794,880,19483,876,0001,179,0002,113,536
8May 11, 2026 20:3510,26596,816,03384,045,0001,155,0002,113,536
9May 11, 2026 20:3510,28294,664,13384,158,0001,185,0002,113,536