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 listFeb 13, 2026 23:40Mikołaj UzarskiMikołaj UzarskiScore: 7,000Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 13, 2026 23:406,91081,024,15852,322,0005,030,0002,478,080
2Feb 13, 2026 23:407,00084,429,27352,090,0006,010,0002,461,696
3Feb 13, 2026 23:407,03083,383,31551,310,0007,042,0002,375,680