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 listDec 11, 2023 21:03metalcoffeemetalcoffeeScore: 517,404Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 11, 2023 21:03509,3594,308,726,1564,227,683,65902,236,416
2Dec 11, 2023 21:03516,9534,361,671,5434,290,711,53402,240,512
3Dec 11, 2023 21:00517,0394,360,610,3754,291,424,75702,256,896
4Dec 11, 2023 21:03517,0874,347,073,3674,291,823,10202,252,800
5Dec 11, 2023 21:00517,4044,350,293,9904,294,455,47602,265,088
6Dec 11, 2023 21:03518,5864,368,632,8404,304,265,79502,228,224
7Dec 11, 2023 21:03520,5084,392,834,9344,320,213,02902,256,896
8Dec 11, 2023 21:00525,3364,427,168,6454,360,288,56102,244,608
9Dec 11, 2023 21:03536,0044,500,304,6194,448,836,49902,248,704