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 19, 2021 20:07Yuriy LyfenkoYuriy LyfenkoScore: 17,561Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 19, 2021 20:0717,5372,216,040,269144,552,0001,003,0002,260,992
2May 19, 2021 20:0717,5391,352,747,765143,582,0001,994,0002,265,088
3May 19, 2021 20:0717,5411,685,485,214142,599,0002,991,0002,523,136
4May 19, 2021 20:0717,5442,285,761,350144,620,000997,0002,260,992
5May 19, 2021 20:0717,5452,825,863,544142,634,0002,992,0002,514,944
6May 19, 2021 20:0717,5512,230,070,057142,679,0002,993,0002,265,088
7May 19, 2021 20:0717,561948,600,542143,760,0001,996,0002,519,040
8May 19, 2021 20:0717,5642,650,119,150142,788,0002,995,0002,527,232
9May 19, 2021 20:0717,5791,264,454,813145,904,00002,260,992
10May 19, 2021 20:0718,009406,371,924149,473,71402,265,088
11May 19, 2021 20:0718,0111,714,928,718149,494,33602,428,928
12May 19, 2021 20:0718,022778,961,156149,585,94302,265,088