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 7, 2026 04:28wnwnScore: 3,381Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 7, 2026 04:413,29335,251,80826,331,0001,003,0002,113,536
2Jul 7, 2026 04:413,29635,339,47426,320,0001,040,0002,113,536
3Jul 7, 2026 04:413,29835,404,90226,342,0001,036,0002,113,536
4Jul 7, 2026 04:413,30035,210,97326,389,0001,005,0002,113,536
5Jul 7, 2026 04:413,38136,110,97327,052,0001,013,0002,113,536
6Jul 7, 2026 04:413,44737,141,85027,614,0001,003,0002,113,536
7Jul 7, 2026 04:413,45337,048,13427,641,0001,025,0002,113,536
8Jul 7, 2026 04:413,46137,314,73027,719,0001,015,0002,113,536
9Jul 7, 2026 04:413,46936,848,02727,766,0001,031,0002,113,536