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 listSep 10, 2021 06:06Andrey TsvetkovAndrey TsvetkovScore: 41,805Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 10, 2021 06:0641,778421,581,238346,760,23802,203,648
2Sep 10, 2021 06:0641,789414,236,510346,846,62602,224,128
3Sep 10, 2021 06:0641,795403,695,608346,900,49902,211,840
4Sep 10, 2021 06:0641,805407,002,205346,981,60002,215,936
5Sep 10, 2021 06:0641,812419,944,003347,041,50802,215,936
6Sep 10, 2021 06:0641,817422,836,095347,082,11502,220,032