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 3, 2026 20:17Josu San MartinJosu San MartinScore: 16,521Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 3, 2026 20:1715,571138,610,973123,884,0005,356,0002,113,536
2Jul 3, 2026 20:1715,585138,646,854124,030,0005,329,0002,113,536
3Jul 3, 2026 20:1715,821140,686,321126,054,0005,262,0002,113,536
4Jul 3, 2026 20:1716,248144,189,449129,630,0005,233,0002,113,536
5Jul 3, 2026 20:1716,521146,539,134131,817,0005,308,0002,113,536
6Jul 3, 2026 20:1716,543146,639,588132,088,0005,225,0002,113,536
7Jul 3, 2026 20:1716,554146,721,555132,081,0005,322,0002,113,536
8Jul 3, 2026 20:1716,570146,892,148132,216,0005,321,0002,113,536
9Jul 3, 2026 20:1716,698148,146,975133,219,0005,379,0002,113,536