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 listFeb 11, 2024 06:29CuteSocksCuteSocksScore: 19,923Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 11, 2024 06:2919,701233,321,099163,520,57302,240,512
2Feb 11, 2024 06:2919,717219,791,852163,652,18402,236,416
3Feb 11, 2024 06:2919,730220,847,243163,758,67202,351,104
4Feb 11, 2024 06:2919,876194,038,055163,973,000999,0002,523,136
5Feb 11, 2024 06:2919,877192,251,464163,981,000999,0002,486,272
6Feb 11, 2024 06:2919,917193,580,258164,308,0001,001,0002,478,080
7Feb 11, 2024 06:2919,923188,670,545164,359,0001,002,0002,297,856
8Feb 11, 2024 06:2920,116194,001,267164,965,0001,999,0002,519,040
9Feb 11, 2024 06:2920,116200,554,851163,967,0002,999,0002,519,040
10Feb 11, 2024 06:2920,119197,195,730163,991,0002,999,0002,519,040
11Feb 11, 2024 06:2920,127191,655,282165,052,0002,000,0002,523,136
12Feb 11, 2024 06:2920,140196,756,467165,161,0002,001,0002,486,272