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 listOct 17, 2025 12:54RyogaRyogaScore: 115,634Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 17, 2025 12:54115,379984,672,796743,728,000213,921,0002,347,008
2Oct 17, 2025 12:54115,496983,333,539743,703,000214,914,0002,334,720
3Oct 17, 2025 12:54115,576985,097,375743,445,000215,839,0002,347,008
4Oct 17, 2025 12:54115,594985,709,923742,560,000216,871,0002,486,272
5Oct 17, 2025 12:54115,634990,381,546744,041,000215,722,0002,383,872
6Oct 17, 2025 12:54115,846987,288,665742,630,000218,891,0002,338,816
7Oct 17, 2025 12:54115,895989,760,714743,172,000218,756,0002,334,720
8Oct 17, 2025 12:54116,099985,556,866743,709,000219,914,0002,334,720
9Oct 17, 2025 12:54116,129992,006,713744,127,000219,742,0002,342,912