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:06Dmitry DolgopolovDmitry DolgopolovScore: 28,982Success
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:0628,910305,642,490239,956,26702,293,760
2May 21, 2021 19:0628,914311,710,806239,984,85502,293,760
3May 21, 2021 19:0628,933293,469,294240,141,30502,256,896
4May 21, 2021 19:0628,972266,033,831239,464,0001,001,0002,265,088
5May 21, 2021 19:0628,973272,521,476239,475,0001,001,0002,285,568
6May 21, 2021 19:0628,978266,850,931239,515,0001,002,0002,277,376
7May 21, 2021 19:0628,982269,887,043239,545,0001,002,0002,285,568
8May 21, 2021 19:0628,983266,409,226240,561,00002,519,040
9May 21, 2021 19:0628,989273,015,431239,607,0001,002,0002,285,568
10May 21, 2021 19:0628,990265,471,101239,612,0001,002,0002,387,968
11May 21, 2021 19:0629,005263,009,866238,742,0001,997,0002,273,280
12May 21, 2021 19:0629,012263,734,686238,805,0001,998,0002,285,568