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 15, 2026 18:40boop34boop34Score: 8,988Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 15, 2026 18:418,95783,920,37973,340,0001,007,0002,113,536
2Jul 15, 2026 18:418,96284,041,68173,373,0001,012,0002,113,536
3Jul 15, 2026 18:418,97584,075,34473,488,0001,007,0002,113,536
4Jul 15, 2026 18:418,98384,088,55573,553,0001,007,0002,113,536
5Jul 15, 2026 18:418,98884,186,43673,518,0001,085,0002,113,536
6Jul 15, 2026 18:418,99484,250,85373,646,0001,005,0002,113,536
7Jul 15, 2026 18:419,00684,313,65373,751,0001,007,0002,113,536
8Jul 15, 2026 18:419,01184,389,59873,787,0001,006,0002,113,536
9Jul 15, 2026 18:419,17785,868,91475,094,0001,077,0002,113,536