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:41Yuriy LyfenkoYuriy LyfenkoScore: 18,873Success
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:4118,5161,697,822,247152,689,000997,0002,260,992
2May 17, 2021 20:4118,8383,063,856,542154,350,0002,004,0002,527,232
3May 17, 2021 20:4118,856329,170,095154,502,0002,006,0002,396,160
4May 17, 2021 20:4118,8733,113,716,665154,654,0001,995,0002,523,136
5May 17, 2021 20:4118,873507,966,759155,648,000997,0002,527,232
6May 17, 2021 20:4118,8772,158,940,315154,671,0002,008,0002,265,088
7May 17, 2021 20:4118,8783,006,017,873154,694,0001,996,0002,256,896
8May 17, 2021 20:4118,885596,973,259155,744,000998,0002,265,088
9May 17, 2021 20:4118,8861,601,756,557154,761,0001,996,0002,260,992