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 17, 2021 20:42Yuriy LyfenkoYuriy LyfenkoScore: 17,508Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 17, 2021 20:4217,4941,155,583,036142,214,0002,983,0002,260,992
2May 17, 2021 20:4217,4961,327,459,230142,234,0002,983,0002,256,896
3May 17, 2021 20:4217,497256,036,727143,206,0002,016,0002,392,064
4May 17, 2021 20:4217,4982,438,677,269144,236,0001,001,0002,252,800
5May 17, 2021 20:4217,5081,135,072,875143,313,0002,004,0002,519,040
6May 17, 2021 20:4217,5163,083,287,617144,382,0001,002,0002,523,136
7May 17, 2021 20:4217,5191,878,622,982145,406,00002,519,040
8May 17, 2021 20:4217,5302,348,273,336142,509,0002,989,0002,519,040
9May 17, 2021 20:4217,5361,505,679,664143,552,0001,993,0002,519,040