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 28, 2022 19:44Jack FrigaardJack FrigaardScore: 6,041Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 28, 2022 19:445,986133,208,75749,684,01402,265,088
2Dec 28, 2022 19:455,995123,107,84049,759,07502,265,088
3Dec 28, 2022 19:456,030122,711,98850,052,46202,289,664
4Dec 28, 2022 19:446,041122,297,96150,142,66902,273,280
5Dec 28, 2022 19:446,074113,393,19150,414,20102,265,088
6Dec 28, 2022 19:456,127120,136,94450,850,10102,269,184