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:08wnwnScore: 3,406Success
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:093,35535,652,34226,819,0001,030,0002,113,536
2Jul 10, 2026 09:093,37835,933,91827,025,0001,013,0002,113,536
3Jul 10, 2026 09:093,38335,906,12027,068,0001,019,0002,113,536
4Jul 10, 2026 09:093,38936,121,07527,121,0001,014,0002,113,536
5Jul 10, 2026 09:093,40636,127,68927,264,0001,014,0002,113,536
6Jul 10, 2026 09:093,45036,479,21227,626,0001,009,0002,113,536
7Jul 10, 2026 09:093,48636,806,24827,913,0001,022,0002,113,536
8Jul 10, 2026 09:093,49336,820,79327,967,0001,030,0002,113,536
9Jul 10, 2026 09:093,54837,402,27228,422,0001,032,0002,113,536