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 16:10Andrey TsvetkovAndrey TsvetkovScore: 42,693Success
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 16:1042,682411,911,589354,259,14702,224,128
2Sep 9, 2021 16:1042,682418,146,254354,261,49902,215,936
3Jan 16, 2022 10:1042,685409,320,528354,283,69502,220,032
4Jan 16, 2022 10:1042,690411,161,144354,328,49002,211,840
5Sep 9, 2021 16:1042,693411,276,079354,350,42002,220,032
6Sep 9, 2021 16:1042,702415,731,303354,422,50502,211,840
7Sep 9, 2021 16:1042,703431,281,162354,437,01702,220,032
8Sep 9, 2021 16:1042,711418,433,481354,503,23002,228,224
9Jan 16, 2022 10:1042,715422,884,967354,538,18202,224,128