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 17:38Victor MerckléVictor MerckléScore: 3,755Success
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 17:393,72039,259,80129,745,0001,134,0002,117,632stderr
2Aug 29, 2026 17:393,72639,257,74529,821,0001,113,0002,117,632stderr
3Aug 29, 2026 17:393,73439,336,51929,933,0001,062,0002,117,632stderr
4Aug 29, 2026 17:393,73940,037,80629,880,0001,157,0002,117,632stderr
5Aug 29, 2026 17:393,75539,515,22730,111,0001,063,0002,117,632stderr
6Aug 29, 2026 17:393,76739,625,49030,136,0001,136,0002,117,632stderr
7Aug 29, 2026 17:393,77439,701,01830,185,0001,144,0002,117,632stderr
8Aug 29, 2026 17:393,79339,841,65630,347,0001,139,0002,117,632stderr
9Aug 29, 2026 17:393,79739,861,88530,385,0001,137,0002,117,632stderr