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:15Yuriy LyfenkoYuriy LyfenkoScore: 13,369Success
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:1513,349135,676,138108,799,0001,996,0002,392,064
2Jun 28, 2021 18:1513,349138,483,402108,800,0001,996,0002,260,992
3Jun 28, 2021 18:1513,357133,236,615109,868,000998,0002,260,992
4Jun 28, 2021 18:1513,362139,739,752109,902,000999,0002,260,992
5Jun 28, 2021 18:1513,362135,742,196108,903,0001,998,0002,396,160
6Jun 28, 2021 18:1513,367137,641,514109,951,000999,0002,260,992
7Jun 28, 2021 18:1513,369142,177,117108,965,0001,999,0002,260,992
8Jun 28, 2021 18:1513,480143,058,060109,883,0001,997,0002,400,256
9Jun 28, 2021 18:1513,495138,517,043111,006,0001,000,0002,260,992
10Jun 28, 2021 18:1513,661174,378,387113,386,20602,277,376
11Jun 28, 2021 18:1513,665171,504,629113,422,01602,265,088
12Jun 28, 2021 18:1513,791185,118,010114,464,16402,269,184