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 7, 2026 04:23wnwnScore: 3,547Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 7, 2026 04:243,46944,507,08027,719,0001,081,0002,113,536
2Jul 7, 2026 04:243,48646,273,74327,891,0001,046,0002,113,536
3Jul 7, 2026 04:243,51845,302,90328,171,0001,036,0002,113,536
4Jul 7, 2026 04:243,54645,229,67428,403,0001,035,0002,113,536
5Jul 7, 2026 04:243,54745,641,05728,352,0001,096,0002,113,536
6Jul 7, 2026 04:243,55244,315,97428,472,0001,012,0002,113,536
7Jul 7, 2026 04:243,63245,603,44529,102,0001,047,0002,113,536
8Jul 7, 2026 04:243,70346,409,84529,666,0001,069,0002,113,536
9Jul 7, 2026 04:243,78049,418,25530,285,0001,097,0002,113,536