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 10, 2026 23:34Victor MerckléVictor MerckléScore: 3,955Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 10, 2026 23:353,93641,061,70831,455,0001,217,0002,117,632stderr
2Aug 10, 2026 23:353,93741,262,45931,484,0001,200,0002,117,632stderr
3Aug 10, 2026 23:353,94141,141,23731,517,0001,198,0002,117,632stderr
4Aug 10, 2026 23:353,94941,239,86631,557,0001,222,0002,117,632stderr
5Aug 10, 2026 23:353,95541,246,63231,618,0001,214,0002,117,632stderr
6Aug 10, 2026 23:353,95741,292,16831,681,0001,165,0002,117,632stderr
7Aug 10, 2026 23:353,95941,265,80131,648,0001,213,0002,117,632stderr
8Aug 10, 2026 23:354,01141,707,16832,080,0001,213,0002,117,632stderr
9Aug 10, 2026 23:354,16242,919,05733,400,0001,152,0002,117,632stderr