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 14, 2026 21:56Victor MerckléVictor MerckléScore: 3,493,597Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 14, 2026 22:013,493,47629,005,515,00528,992,845,0003,010,0002,117,632stderr
2May 14, 2026 22:013,493,53729,004,693,83628,993,361,0003,004,0002,117,632stderr
3May 14, 2026 22:013,493,55929,005,722,00928,995,540,0001,000,0002,117,632stderr
4May 14, 2026 22:013,493,59429,007,547,01528,995,729,0001,103,0002,117,632stderr
5May 14, 2026 22:013,493,59729,005,921,35428,993,759,0003,103,0002,117,632stderr
6May 14, 2026 22:013,493,64329,005,885,37728,996,237,0001,000,0002,117,632stderr
7May 14, 2026 22:013,493,67729,006,366,15228,996,522,0001,002,0002,117,632stderr
8May 14, 2026 22:013,493,68429,007,995,10728,996,459,0001,119,0002,117,632stderr
9May 14, 2026 22:013,493,71029,006,697,42128,996,787,0001,009,0002,117,632stderr