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 16, 2026 17:16boop34boop34Score: 9,040Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 16, 2026 17:168,98284,069,36973,545,0001,007,0002,113,536
2Jul 16, 2026 17:168,99284,307,45973,632,0001,006,0002,113,536
3Jul 16, 2026 17:169,00084,279,68973,679,0001,022,0002,113,536
4Jul 16, 2026 17:169,00184,431,25073,703,0001,007,0002,113,536
5Jul 16, 2026 17:169,04084,560,81074,028,0001,008,0002,113,536
6Jul 16, 2026 17:169,09885,032,70774,503,0001,012,0002,113,536
7Jul 16, 2026 17:169,13685,414,14374,790,0001,039,0002,113,536
8Jul 16, 2026 17:169,14785,632,31774,922,0001,006,0002,113,536
9Jul 16, 2026 17:169,15185,661,51274,952,0001,007,0002,113,536