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 17, 2026 21:22Adam FolwarcznyAdam FolwarcznyScore: 75,892Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 17, 2026 21:2275,853639,282,791628,585,0001,001,0002,113,536
2Jul 17, 2026 21:2275,861639,299,892628,649,0001,001,0002,113,536
3Jul 17, 2026 21:2275,865639,381,916628,679,0001,001,0002,113,536
4Jul 17, 2026 21:2275,882639,396,184628,826,0001,001,0002,113,536
5Jul 17, 2026 21:2275,892639,616,617628,904,0001,002,0002,113,536
6Jul 17, 2026 21:2275,898639,614,643628,958,0001,002,0002,113,536
7Jul 17, 2026 21:2275,900639,571,636628,975,0001,003,0002,113,536
8Jul 17, 2026 21:2275,901639,560,663628,980,0001,003,0002,113,536
9Jul 17, 2026 21:2275,904639,780,416629,002,0001,002,0002,113,536