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 2, 2023 20:21Yuriy LyfenkoYuriy LyfenkoScore: 81,542Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 2, 2023 20:2181,540729,319,143676,783,16902,207,744
2Dec 2, 2023 20:2181,542734,042,169676,795,01802,220,032
3Dec 2, 2023 20:2181,853748,725,923679,382,39902,199,552