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 24, 2023 15:56Alexander KrivolapovAlexander KrivolapovScore: 19,918Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 24, 2023 15:5619,669229,764,494163,248,96102,351,104
2Dec 24, 2023 15:5619,683236,431,705163,367,86602,347,008
3Dec 24, 2023 15:5619,714226,849,476163,630,32702,224,128
4Dec 24, 2023 15:5619,865190,435,129163,883,000999,0002,478,080
5Dec 24, 2023 15:5619,878193,159,380163,987,000999,0002,519,040
6Dec 24, 2023 15:5619,881193,019,932161,013,0004,000,0002,482,176
7Dec 24, 2023 15:5619,918193,793,182162,318,0003,005,0002,519,040
8Dec 24, 2023 15:5620,099192,897,979163,827,0002,996,0002,519,040
9Dec 24, 2023 15:5620,123191,221,064164,021,0003,000,0002,523,136
10Dec 24, 2023 15:5620,157192,283,439165,304,0002,003,0002,310,144
11Dec 24, 2023 15:5620,167192,703,891166,381,0001,002,0002,482,176
12Dec 24, 2023 15:5620,182196,102,419166,504,0001,003,0002,510,848