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 listSep 26, 2021 13:31Ilya AniskovetsIlya AniskovetsScore: 42,039Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 26, 2021 13:3142,025408,404,818348,805,92602,277,376
2Sep 26, 2021 13:3642,029410,596,093348,839,33202,269,184
3Sep 26, 2021 13:3642,034418,945,709348,879,61202,269,184
4Sep 26, 2021 13:3142,039425,992,794348,919,84702,265,088
5Sep 26, 2021 13:3142,042411,545,208348,948,52902,269,184
6Sep 26, 2021 13:3642,055409,190,757349,055,61702,277,376