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 7, 2021 15:59Yuriy LyfenkoYuriy LyfenkoError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 7, 2021 15:5800000Error: expected "53692739207587378 ", got "53692739207331478 "
2Sep 7, 2021 15:5800000Error: expected "53689278209622899 ", got "53689278209366999 "
3Sep 7, 2021 15:5900000Error: expected "53682532425614721 ", got "53682532425358821 "
4Dec 20, 2021 18:1800000Error: expected "53690634788067712 ", got "53690634531911812 "
5Dec 20, 2021 18:1900000Error: expected "53683522182726090 ", got "53683522182470190 "
6Sep 7, 2021 15:5935,457354,924,786294,290,17902,220,032
7Sep 7, 2021 15:5935,482361,699,857294,498,25802,215,936
8Sep 7, 2021 15:5935,483357,207,356294,505,57502,215,936