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 listApr 18, 2023 05:02Aaron LoviAaron LoviScore: 46,772Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 18, 2023 04:5846,740453,673,414387,945,21702,277,376
2Apr 18, 2023 04:5846,755448,818,561388,069,02502,285,568
3Apr 18, 2023 05:0046,763451,221,190388,129,86802,285,568
4Apr 18, 2023 05:0246,766442,717,935388,160,71702,281,472
5Apr 18, 2023 05:0046,772446,088,673388,207,92702,277,376
6Apr 18, 2023 05:0246,773446,779,463388,219,65902,289,664
7Apr 18, 2023 05:0246,773452,255,991388,220,00302,285,568
8Apr 18, 2023 05:0046,785457,184,668388,318,69502,285,568
9Apr 18, 2023 04:5846,891463,908,708389,194,48202,285,568