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 22:18Yuriy LyfenkoYuriy LyfenkoScore: 13,177Success
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 22:1813,154384,948,510109,182,00002,523,136
2Jun 30, 2021 22:1813,158378,284,850109,214,00002,260,992
3Jun 30, 2021 22:1813,159379,668,152108,215,0001,001,0002,260,992
4Jun 30, 2021 22:1813,165384,681,652108,267,0001,002,0002,265,088
5Jun 30, 2021 22:1813,169382,206,790108,304,0001,002,0002,260,992
6Jun 30, 2021 22:1813,173386,271,196109,340,00002,260,992
7Jun 30, 2021 22:1813,177380,642,944108,366,0001,003,0002,260,992
8Jun 30, 2021 22:1813,178387,800,432109,374,00002,260,992
9Jun 30, 2021 22:1813,354383,906,735108,844,0001,997,0002,260,992
10Jun 30, 2021 22:1814,178431,538,342117,681,53402,265,088
11Jun 30, 2021 22:1814,182425,556,823117,711,49402,240,512
12Jun 30, 2021 22:1814,200427,096,670117,863,95102,260,992