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 15, 2023 13:19matsuoka-601matsuoka-601Score: 7,131Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 15, 2023 13:197,03485,683,53356,369,0002,013,0002,260,992
2Dec 15, 2023 13:197,05187,719,40357,513,0001,009,0002,260,992
3Dec 15, 2023 13:197,08484,687,23557,802,000996,0002,396,160
4Dec 15, 2023 13:197,09079,434,17557,848,000997,0002,408,448
5Dec 15, 2023 13:197,09881,048,81356,917,0001,997,0002,523,136
6Dec 15, 2023 13:197,10182,222,87756,944,0001,998,0002,404,352
7Dec 15, 2023 13:197,13181,984,75357,178,0002,006,0002,260,992
8Dec 15, 2023 13:197,18290,916,79859,609,00002,396,160
9Dec 15, 2023 13:197,20788,492,62558,823,000997,0002,523,136
10Dec 15, 2023 13:197,404122,786,86361,456,26702,273,280
11Dec 15, 2023 13:197,408138,621,19661,489,88102,277,376
12Dec 15, 2023 13:197,494129,740,72662,204,01002,260,992