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 21, 2021 19:07Dmitry DolgopolovDmitry DolgopolovScore: 28,976Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 21, 2021 19:0728,912300,608,078239,967,50602,293,760
2May 21, 2021 19:0728,916309,760,692240,003,22902,285,568
3May 21, 2021 19:0728,917307,747,791240,008,83902,252,800
4May 21, 2021 19:0728,952266,978,461239,297,0001,001,0002,285,568
5May 21, 2021 19:0728,953264,045,455239,311,0001,001,0002,285,568
6May 21, 2021 19:0728,958261,971,181239,352,0001,001,0002,285,568
7May 21, 2021 19:0728,976264,379,176239,499,0001,002,0002,260,992
8May 21, 2021 19:0728,982266,660,137240,554,00002,285,568
9May 21, 2021 19:0729,002268,596,178238,722,0001,997,0002,523,136
10May 21, 2021 19:0729,003270,947,583240,721,00002,285,568
11May 21, 2021 19:0729,004265,764,580239,736,000998,0002,285,568
12May 21, 2021 19:0729,006268,941,264238,750,0001,997,0002,285,568