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 10, 2026 09:40wnwnScore: 3,325Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 10, 2026 09:403,30035,275,23826,360,0001,032,0002,113,536
2Jul 10, 2026 09:403,30335,607,68326,385,0001,036,0002,113,536
3Jul 10, 2026 09:403,30335,498,68426,382,0001,035,0002,113,536
4Jul 10, 2026 09:403,30536,826,96126,396,0001,041,0002,113,536
5Jul 10, 2026 09:403,32535,703,16926,522,0001,079,0002,113,536
6Jul 10, 2026 09:403,38036,166,16827,041,0001,018,0002,113,536
7Jul 10, 2026 09:403,44937,181,07727,593,0001,034,0002,113,536
8Jul 10, 2026 09:403,46537,394,22027,700,0001,063,0002,113,536
9Jul 10, 2026 09:403,47237,373,17427,790,0001,030,0002,113,536