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 24, 2026 23:44Victor MerckléVictor MerckléScore: 3,859Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 24, 2026 23:453,76139,703,50229,979,0001,238,0002,117,632stderr
2Aug 24, 2026 23:453,80240,013,45630,358,0001,206,0002,117,632stderr
3Aug 24, 2026 23:453,80839,969,49230,427,0001,182,0002,117,632stderr
4Aug 24, 2026 23:453,81040,051,13030,464,0001,165,0002,117,632stderr
5Aug 24, 2026 23:453,85940,423,63330,847,0001,189,0002,117,632stderr
6Aug 24, 2026 23:453,86641,327,00830,846,0001,244,0002,117,632stderr
7Aug 24, 2026 23:453,97441,484,94631,743,0001,244,0002,117,632stderr
8Aug 24, 2026 23:454,07442,540,98632,629,0001,186,0002,117,632stderr
9Aug 24, 2026 23:454,08742,322,67232,759,0001,167,0002,117,632stderr