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 listFeb 11, 2024 08:08CuteSocksCuteSocksScore: 19,988Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 11, 2024 08:0819,699233,457,071163,503,56602,236,416
2Feb 11, 2024 08:0819,713235,867,210163,620,13202,232,320
3Feb 11, 2024 08:0819,724221,305,047163,712,16902,359,296
4Feb 11, 2024 08:0819,849189,160,954163,752,000998,0002,519,040
5Feb 11, 2024 08:0819,863191,146,054162,868,0001,998,0002,326,528
6Feb 11, 2024 08:0819,910196,388,323163,246,0002,003,0002,478,080
7Feb 11, 2024 08:0819,988196,019,519163,901,0001,998,0002,523,136
8Feb 11, 2024 08:0820,011190,237,996164,090,0002,001,0002,486,272
9Feb 11, 2024 08:0820,028190,819,755165,230,0001,001,0002,478,080
10Feb 11, 2024 08:0820,053192,615,200165,436,0001,002,0002,519,040
11Feb 11, 2024 08:0820,054188,357,575164,445,0002,005,0002,523,136
12Feb 11, 2024 08:0820,207196,917,183166,721,000998,0002,486,272