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 27, 2026 05:55Victor MerckléVictor MerckléScore: 4,058Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 27, 2026 05:554,04743,244,80932,508,0001,087,0002,117,632stderr
2Aug 27, 2026 05:554,04841,926,52332,499,0001,107,0002,117,632stderr
3Aug 27, 2026 05:554,05041,933,96732,480,0001,139,0002,117,632stderr
4Aug 27, 2026 05:554,05641,995,11932,585,0001,083,0002,117,632stderr
5Aug 27, 2026 05:554,05842,007,51132,522,0001,164,0002,117,632stderr
6Aug 27, 2026 05:554,06542,056,00432,569,0001,172,0002,117,632stderr
7Aug 27, 2026 05:554,07843,074,77132,618,0001,230,0002,117,632stderr
8Aug 27, 2026 05:554,08542,260,69932,783,0001,126,0002,117,632stderr
9Aug 27, 2026 05:554,08842,239,09932,836,0001,095,0002,117,632stderr