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 14:47Kevin HeaveyKevin HeaveyScore: 3,907Success
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 15:053,67240,323,61829,436,0001,049,0002,113,536
2Jul 17, 2026 15:053,71240,649,52929,766,0001,048,0002,113,536
3Jul 17, 2026 15:053,79941,352,20530,490,0001,048,0002,113,536
4Jul 17, 2026 15:053,88442,146,68931,200,0001,043,0002,113,536
5Jul 17, 2026 15:053,90742,226,25531,386,0001,043,0002,113,536
6Jul 17, 2026 15:053,97342,819,06631,952,0001,025,0002,113,536
7Jul 17, 2026 15:053,97542,878,76831,950,0001,045,0002,113,536
8Jul 17, 2026 15:053,97842,933,27931,980,0001,041,0002,113,536
9Jul 17, 2026 15:054,00343,165,45332,184,0001,043,0002,113,536