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 listJun 30, 2021 23:48Yuriy LyfenkoYuriy LyfenkoScore: 15,151Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 30, 2021 23:4814,846434,722,183123,220,91902,232,320
2Jun 30, 2021 23:4814,849445,944,349123,249,09702,252,800
3Jun 30, 2021 23:4814,853429,152,599123,280,92902,256,896
4Jun 30, 2021 23:4815,138401,414,340124,648,000997,0002,392,064
5Jun 30, 2021 23:4815,146405,204,585123,718,0001,995,0002,392,064
6Jun 30, 2021 23:4815,148402,822,340123,730,0001,995,0002,260,992
7Jun 30, 2021 23:4815,151401,086,354123,760,0001,996,0002,392,064
8Jun 30, 2021 23:4815,160401,739,900123,827,0001,997,0002,396,160
9Jun 30, 2021 23:4815,163403,976,591124,859,000998,0002,523,136
10Jun 30, 2021 23:4815,164405,395,511123,865,0001,997,0002,392,064
11Jun 30, 2021 23:4815,165400,602,878124,874,000998,0002,387,968
12Jun 30, 2021 23:4815,386404,054,703125,706,0001,995,0002,387,968