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 29, 2026 14:15Victor MerckléVictor MerckléScore: 4,446Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 29, 2026 14:184,43945,359,43635,726,0001,123,0002,117,632stderr
2Aug 29, 2026 14:184,44346,377,24235,780,0001,097,0002,117,632stderr
3Aug 29, 2026 14:184,44445,391,74035,794,0001,098,0002,117,632stderr
4Aug 29, 2026 14:184,44545,285,11835,785,0001,112,0002,117,632stderr
5Aug 29, 2026 14:184,44645,277,81535,810,0001,097,0002,117,632stderr
6Aug 29, 2026 14:184,44845,979,13135,794,0001,127,0002,117,632stderr
7Aug 29, 2026 14:184,46145,416,69035,930,0001,103,0002,117,632stderr
8Aug 29, 2026 14:184,47745,492,90936,144,0001,019,0002,117,632stderr
9Aug 29, 2026 14:184,48345,565,24036,158,0001,056,0002,117,632stderr