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 11, 2026 14:07Victor MerckléVictor MerckléScore: 4,385Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 11, 2026 14:084,24743,659,46134,163,0001,094,0002,117,632stderr
2Aug 11, 2026 14:084,26243,727,81934,358,0001,021,0002,117,632stderr
3Aug 11, 2026 14:084,27243,866,73934,426,0001,035,0002,117,632stderr
4Aug 11, 2026 14:084,31544,201,24434,801,0001,019,0002,117,632stderr
5Aug 11, 2026 14:084,38544,781,97835,381,0001,018,0002,117,632stderr
6Aug 11, 2026 14:084,50645,815,67336,279,0001,121,0002,117,632stderr
7Aug 11, 2026 14:084,51545,937,87136,362,0001,120,0002,117,632stderr
8Aug 11, 2026 14:084,52546,476,42836,526,0001,037,0002,117,632stderr
9Aug 11, 2026 14:084,61946,792,28437,243,0001,097,0002,117,632stderr