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 25, 2026 15:27Victor MerckléVictor MerckléScore: 10,856Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 25, 2026 15:2710,78397,669,23988,496,0001,006,0002,117,632stderr
2Aug 25, 2026 15:2710,81197,896,44888,730,0001,006,0002,117,632stderr
3Aug 25, 2026 15:2710,81598,791,66288,763,0001,007,0002,117,632stderr
4Aug 25, 2026 15:2710,85098,485,47489,049,0001,007,0002,117,632stderr
5Aug 25, 2026 15:2710,85698,663,43989,099,0001,007,0002,117,632stderr
6Aug 25, 2026 15:2710,92698,833,51589,681,0001,007,0002,117,632stderr
7Aug 25, 2026 15:2711,120100,607,47991,294,0001,006,0002,117,632stderr
8Aug 25, 2026 15:2711,345102,505,81393,164,0001,007,0002,117,632stderr
9Aug 25, 2026 15:2711,435103,287,82893,908,0001,007,0002,117,632stderr