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 30, 2026 21:51Victor MerckléVictor MerckléScore: 3,808Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 30, 2026 21:523,79040,479,51930,347,0001,115,0002,117,632stderr
2Aug 30, 2026 21:523,79240,595,18530,331,0001,144,0002,117,632stderr
3Aug 30, 2026 21:523,79739,934,51530,381,0001,141,0002,117,632stderr
4Aug 30, 2026 21:523,80640,712,94730,422,0001,169,0002,117,632stderr
5Aug 30, 2026 21:523,80840,739,42330,323,0001,289,0002,117,632stderr
6Aug 30, 2026 21:523,81840,096,90130,559,0001,134,0002,117,632stderr
7Aug 30, 2026 21:523,82740,149,06830,615,0001,150,0002,117,632stderr
8Aug 30, 2026 21:523,84040,249,75830,824,0001,051,0002,117,632stderr
9Aug 30, 2026 21:523,84150,195,94430,760,0001,121,0002,117,632stderr