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 28, 2026 19:16Victor MerckléVictor MerckléScore: 3,795Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 28, 2026 19:163,76339,574,35230,117,0001,120,0002,117,632stderr
2Aug 28, 2026 19:163,76739,457,63730,115,0001,153,0002,117,632stderr
3Aug 28, 2026 19:163,77139,504,30930,156,0001,151,0002,117,632stderr
4Aug 28, 2026 19:163,78239,497,35830,303,0001,095,0002,117,632stderr
5Aug 28, 2026 19:163,79539,728,44030,416,0001,090,0002,117,632stderr
6Aug 28, 2026 19:163,79640,545,46530,368,0001,143,0002,117,632stderr
7Aug 28, 2026 19:163,80239,695,92830,486,0001,077,0002,117,632stderr
8Aug 28, 2026 19:163,82039,836,08030,563,0001,146,0002,117,632stderr
9Aug 28, 2026 19:163,82640,005,86030,701,0001,059,0002,117,632stderr