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 06:42Victor MerckléVictor MerckléScore: 3,786Success
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 06:433,76539,611,67430,117,0001,140,0002,117,632stderr
2Aug 12, 2026 06:433,77240,922,20430,118,0001,192,0002,117,632stderr
3Aug 12, 2026 06:433,77539,727,69130,239,0001,100,0002,117,632stderr
4Aug 12, 2026 06:433,78539,822,76630,304,0001,112,0002,117,632stderr
5Aug 12, 2026 06:433,78639,811,36930,290,0001,137,0002,117,632stderr
6Aug 12, 2026 06:433,79239,893,05630,380,0001,096,0002,117,632stderr
7Aug 12, 2026 06:433,80339,918,99130,499,0001,074,0002,117,632stderr
8Aug 12, 2026 06:433,95341,197,50231,760,0001,050,0002,117,632stderr
9Aug 12, 2026 06:433,98641,470,22331,965,0001,125,0002,117,632stderr