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 28, 2021 18:16Yuriy LyfenkoYuriy LyfenkoScore: 13,706Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 28, 2021 18:1613,691390,944,970111,645,0001,993,0002,387,968
2Jun 28, 2021 18:1613,694389,860,315111,664,0001,994,0002,260,992
3Jun 28, 2021 18:1613,694389,197,241111,665,0001,994,0002,260,992
4Jun 28, 2021 18:1613,697393,628,418111,694,0001,994,0002,523,136
5Jun 28, 2021 18:1613,698395,204,915112,694,000997,0002,260,992
6Jun 28, 2021 18:1613,700388,133,225113,711,00002,260,992
7Jun 28, 2021 18:1613,706386,445,511112,760,000997,0002,260,992
8Jun 28, 2021 18:1613,708392,683,317112,776,000998,0002,260,992
9Jun 28, 2021 18:1613,710392,069,900112,797,000998,0002,387,968
10Jun 28, 2021 18:1613,721421,500,051113,887,13402,240,512
11Jun 28, 2021 18:1613,723435,799,142113,900,83102,240,512
12Jun 28, 2021 18:1613,732418,646,902113,975,33502,269,184