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 12, 2026 04:08Victor MerckléVictor MerckléScore: 4,847Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 12, 2026 04:094,84348,582,34139,179,0001,024,0002,117,632stderr
2Aug 12, 2026 04:094,84648,604,74739,212,0001,015,0002,117,632stderr
3Aug 12, 2026 04:094,84748,615,82939,144,0001,092,0002,117,632stderr
4Aug 12, 2026 04:094,84748,631,91239,198,0001,040,0002,117,632stderr
5Aug 12, 2026 04:094,84748,646,89939,210,0001,024,0002,117,632stderr
6Aug 12, 2026 04:094,86848,820,50139,314,0001,098,0002,117,632stderr
7Aug 12, 2026 04:094,87048,820,17939,406,0001,015,0002,117,632stderr
8Aug 12, 2026 04:094,87448,898,45039,381,0001,081,0002,117,632stderr
9Aug 12, 2026 04:094,87848,922,44339,475,0001,013,0002,117,632stderr