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 listJan 11, 2023 18:34Kevin HeaveyKevin HeaveyScore: 52,848Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 11, 2023 18:3452,814497,571,682438,358,10202,228,224
2Jan 11, 2023 18:3052,835507,316,398438,529,40402,256,896
3Jan 11, 2023 18:3252,836522,084,766438,536,22202,220,032
4Jan 11, 2023 18:3252,836523,405,861438,538,47802,236,416
5Jan 11, 2023 18:3052,841501,019,851438,580,28002,236,416
6Jan 11, 2023 18:3252,847509,044,060438,634,01402,260,992
7Jan 11, 2023 18:3352,848512,135,314438,635,99102,228,224
8Jan 11, 2023 18:3352,851501,051,791438,664,89802,228,224
9Jan 11, 2023 18:3352,853517,386,133438,682,23402,228,224
10Jan 11, 2023 18:3052,859517,639,335438,730,75002,220,032
11Jan 11, 2023 18:3452,860514,575,461438,735,61702,232,320
12Jan 11, 2023 18:3452,860523,764,924438,736,74802,224,128