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 13, 2025 19:41Tony SolomonikTony SolomonikScore: 107,181Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 13, 2025 19:41107,162915,905,011827,481,00061,961,0002,359,296
2Sep 13, 2025 19:41107,181911,118,379829,627,00059,973,0002,355,200
3Sep 13, 2025 19:41107,231912,799,972825,015,00065,001,0002,359,296