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 listJun 25, 2023 09:57Gubin DmitryGubin DmitryScore: 61,756Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 25, 2023 09:5861,635584,388,638511,566,38602,207,744
2Jun 25, 2023 09:5761,645577,506,573511,652,38602,215,936
3Jun 25, 2023 09:5861,704568,221,293512,140,09902,207,744
4Jun 25, 2023 09:5861,756573,109,898512,574,80202,211,840
5Jun 25, 2023 09:5761,775569,708,107512,733,56702,203,648
6Jun 25, 2023 09:5761,861575,265,919513,447,12802,260,992