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 16:22CodeReclaimersCodeReclaimersScore: 15,729Success
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 16:2315,704140,427,895129,168,0001,182,0002,113,536
2Jul 30, 2026 16:2315,706140,423,422129,187,0001,175,0002,113,536
3Jul 30, 2026 16:2315,710140,437,266129,219,0001,175,0002,113,536
4Jul 30, 2026 16:2315,725140,600,196129,346,0001,172,0002,113,536
5Jul 30, 2026 16:2315,729142,932,491129,296,0001,262,0002,113,536
6Jul 30, 2026 16:2315,782140,992,494129,836,0001,162,0002,113,536
7Jul 30, 2026 16:2315,783141,023,296129,828,0001,173,0002,113,536
8Jul 30, 2026 16:2315,790141,073,752129,990,0001,069,0002,113,536
9Jul 30, 2026 16:2315,815141,370,008130,261,0001,005,0002,113,536