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 17:34Victor MerckléVictor MerckléScore: 3,776Success
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 17:353,75940,169,05630,095,0001,105,0002,117,632stderr
2Aug 24, 2026 17:353,76839,680,73930,185,0001,096,0002,117,632stderr
3Aug 24, 2026 17:353,76939,658,25130,176,0001,107,0002,117,632stderr
4Aug 24, 2026 17:353,77039,707,46930,170,0001,122,0002,117,632stderr
5Aug 24, 2026 17:353,77640,267,63230,263,0001,082,0002,117,632stderr
6Aug 24, 2026 17:353,78841,091,90130,253,0001,188,0002,117,632stderr
7Aug 24, 2026 17:353,78939,842,74030,252,0001,201,0002,117,632stderr
8Aug 24, 2026 17:353,79739,951,50730,385,0001,134,0002,117,632stderr
9Aug 24, 2026 17:353,99442,354,33232,027,0001,124,0002,117,632stderr