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 3, 2026 17:49Josu San MartinJosu San MartinScore: 10,803Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 3, 2026 17:4910,75998,695,88488,291,0001,012,0002,113,536
2Jul 3, 2026 17:4910,76498,739,47188,333,0001,011,0002,113,536
3Jul 3, 2026 17:4910,76798,736,16488,356,0001,012,0002,113,536
4Jul 3, 2026 17:4910,776100,231,97388,435,0001,012,0002,113,536
5Jul 3, 2026 17:4910,80399,260,69287,652,0002,016,0002,113,536
6Jul 3, 2026 17:4910,82599,268,70088,842,0001,012,0002,113,536
7Jul 3, 2026 17:4910,83099,317,58288,881,0001,011,0002,113,536
8Jul 3, 2026 17:4910,88899,682,11189,360,0001,011,0002,113,536
9Jul 3, 2026 17:4910,90899,985,66989,531,0001,012,0002,113,536