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:44Yuriy LyfenkoYuriy LyfenkoScore: 17,539Success
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:4417,5342,769,618,273144,535,000996,0002,260,992
2May 17, 2021 20:4417,5352,731,110,833143,546,0001,993,0002,523,136
3May 17, 2021 20:4417,5352,607,742,479143,545,0001,993,0002,523,136
4May 17, 2021 20:4417,5372,762,686,037142,570,0002,990,0002,519,040
5May 17, 2021 20:4417,539972,279,530143,582,0001,994,0002,256,896
6May 17, 2021 20:4417,5481,351,377,239145,652,00002,256,896
7May 17, 2021 20:4417,5521,382,470,604143,684,0001,995,0002,256,896
8May 17, 2021 20:4417,5593,072,066,199144,743,000998,0002,256,896
9May 17, 2021 20:4417,5621,536,217,940144,768,000998,0002,265,088