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 9, 2021 18:41Andrey TsvetkovAndrey TsvetkovScore: 41,538Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 9, 2021 18:3941,524413,171,901344,650,38202,224,128
2Sep 9, 2021 18:3941,534403,401,161344,735,11902,224,128
3Sep 9, 2021 18:3941,535405,593,862344,744,01402,215,936
4Sep 9, 2021 18:4141,537415,013,030344,756,43502,224,128
5Sep 9, 2021 19:4441,538403,651,123344,761,36802,215,936
6Sep 9, 2021 19:4441,538407,281,166344,764,00402,220,032
7Sep 9, 2021 18:4141,541411,681,575344,790,16702,228,224
8Sep 9, 2021 19:4441,555410,190,658344,909,76102,215,936
9Sep 9, 2021 18:4141,564396,215,215344,982,12302,220,032