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 25, 2025 09:01Wookyung JeongWookyung JeongScore: 57,745Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 25, 2025 08:5457,723507,313,739478,097,0001,000,0002,510,848
2Sep 25, 2025 09:0157,727510,510,419478,131,0001,000,0002,519,040
3Sep 25, 2025 08:5457,735500,745,908478,204,0001,000,0002,510,848
4Sep 25, 2025 09:0157,745505,349,522477,281,0002,001,0002,383,872
5Sep 25, 2025 08:5457,748504,191,828478,309,0001,000,0002,510,848
6Sep 25, 2025 09:0157,784502,762,443478,610,000999,0002,510,848