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 24, 2026 17:18Victor MerckléVictor MerckléScore: 3,797Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 24, 2026 17:193,73639,546,80429,893,0001,116,0002,117,632stderr
2Aug 24, 2026 17:193,74339,455,62729,948,0001,127,0002,117,632stderr
3Aug 24, 2026 17:193,76539,620,96830,083,0001,173,0002,117,632stderr
4Aug 24, 2026 17:193,78639,822,55230,352,0001,080,0002,117,632stderr
5Aug 24, 2026 17:193,79739,877,46630,425,0001,091,0002,117,632stderr
6Aug 24, 2026 17:193,81140,054,89930,543,0001,090,0002,117,632stderr
7Aug 24, 2026 17:193,86740,524,38131,014,0001,088,0002,117,632stderr
8Aug 24, 2026 17:193,88940,678,72131,114,0001,168,0002,117,632stderr
9Aug 24, 2026 17:194,04841,980,20832,533,0001,066,0002,117,632stderr