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 29, 2022 16:04Jack FrigaardJack FrigaardScore: 5,289Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 29, 2022 16:045,260115,462,22943,656,24502,179,072
2Dec 29, 2022 16:045,269105,773,99343,732,76902,301,952
3Dec 29, 2022 16:045,279115,084,17743,817,51902,174,976
4Dec 29, 2022 16:045,28894,770,51043,893,14402,289,664
5Dec 29, 2022 16:045,289119,508,82343,900,02202,301,952
6Dec 29, 2022 16:045,316119,061,63844,119,91302,174,976
7Dec 29, 2022 16:057,216115,093,43259,893,60702,179,072
8Dec 29, 2022 16:057,241119,794,48960,103,08502,183,168
9Dec 29, 2022 16:057,251127,152,62760,179,98702,301,952