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 listOct 1, 2026 23:23Karthik ReddyKarthik ReddyScore: 14,414Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 1, 2026 23:2414,345129,649,83525,706,00093,361,0002,113,536
2Oct 1, 2026 23:2414,351130,523,84325,584,00093,533,0002,113,536
3Oct 1, 2026 23:2414,379129,889,13125,672,00093,679,0002,113,536
4Oct 1, 2026 23:2414,398130,060,38925,679,00093,827,0002,113,536
5Oct 1, 2026 23:2414,414131,012,19025,684,00093,960,0002,113,536
6Oct 1, 2026 23:2414,438130,359,21225,718,00094,119,0002,113,536
7Oct 1, 2026 23:2414,451130,643,22025,702,00094,243,0002,113,536
8Oct 1, 2026 23:2414,471130,667,00925,751,00094,363,0002,113,536
9Oct 1, 2026 23:2414,516130,987,87425,725,00094,766,0002,113,536