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 5, 2025 20:53Rajarshi BasuRajarshi BasuScore: 44,531Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 5, 2025 20:5344,047395,152,849351,607,00013,984,0002,338,816
2Dec 5, 2025 20:5344,531400,789,085356,624,00012,986,0002,412,544
3Dec 5, 2025 20:5344,585399,686,131357,052,00013,001,0002,527,232