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 listJul 30, 2026 20:26wnwnScore: 3,304Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 30, 2026 20:263,28335,418,96626,220,0001,029,0002,113,536
2Jul 30, 2026 20:263,29335,746,62326,310,0001,026,0002,113,536
3Jul 30, 2026 20:263,29935,798,51326,364,0001,024,0002,113,536
4Jul 30, 2026 20:263,30235,801,91426,383,0001,031,0002,113,536
5Jul 30, 2026 20:263,30435,779,19226,405,0001,026,0002,113,536
6Jul 30, 2026 20:263,30635,618,95026,405,0001,039,0002,113,536
7Jul 30, 2026 20:263,30835,885,05626,426,0001,036,0002,113,536
8Jul 30, 2026 20:263,32635,989,75826,532,0001,077,0002,113,536
9Jul 30, 2026 20:263,44537,688,56627,566,0001,030,0002,113,536