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 14, 2021 20:01Yuriy LyfenkoYuriy LyfenkoScore: 17,924Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 14, 2021 20:0117,896180,115,247148,535,00002,396,160
2May 14, 2021 20:0117,897174,473,309147,540,0001,003,0002,387,968
3May 14, 2021 20:0117,901175,141,786147,574,0001,003,0002,260,992
4May 14, 2021 20:0117,923176,448,150146,763,0001,996,0002,260,992
5May 14, 2021 20:0117,924179,973,133147,775,000998,0002,260,992
6May 14, 2021 20:0118,025176,467,421148,606,0001,004,0002,260,992
7May 14, 2021 20:0118,046179,547,307147,784,0001,997,0002,260,992
8May 14, 2021 20:0118,376182,127,553151,519,0001,003,0002,260,992
9May 14, 2021 20:0118,382183,245,597150,580,0001,994,0002,523,136