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 listDec 11, 2023 20:55metalcoffeemetalcoffeeScore: 1,644,474Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 11, 2023 20:541,636,74313,636,475,88313,584,969,17902,260,992
2Dec 11, 2023 20:541,641,80113,690,894,82213,626,952,32202,256,896
3Dec 11, 2023 20:551,641,87113,702,106,64113,627,531,14702,265,088
4Dec 11, 2023 20:541,644,47413,717,951,70313,649,138,09802,252,800
5Dec 11, 2023 20:551,654,48413,791,887,63913,732,216,87502,256,896
6Dec 11, 2023 20:551,654,86413,796,887,77013,735,371,40402,252,800