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 listMay 24, 2021 04:18evgenikwtevgenikwtScore: 49,288Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 24, 2021 04:1849,243456,425,861408,712,90802,265,088
2May 24, 2021 04:0049,258463,214,776408,843,51702,265,088
3May 24, 2021 04:0049,273459,891,251408,969,30202,273,280
4May 24, 2021 04:1849,288470,197,370409,087,34102,273,280
5May 24, 2021 04:1849,290487,173,696409,110,38902,265,088
6May 24, 2021 04:0049,296474,304,665409,155,87302,265,088