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 27, 2026 02:04Kevin HeaveyKevin HeaveyScore: 3,614Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 27, 2026 02:053,54539,492,53228,295,0001,134,0002,113,536
2Jul 27, 2026 02:053,58939,904,50928,609,0001,187,0002,113,536
3Jul 27, 2026 02:053,59539,704,03828,682,0001,163,0002,113,536
4Jul 27, 2026 02:053,60440,017,28028,872,0001,046,0002,113,536
5Jul 27, 2026 02:053,61440,108,82528,847,0001,155,0002,113,536
6Jul 27, 2026 02:053,61940,262,78728,891,0001,152,0002,113,536
7Jul 27, 2026 02:054,36846,324,86228,433,0007,829,0002,113,536
8Jul 27, 2026 02:054,46247,213,53928,657,0008,384,0002,113,536
9Jul 27, 2026 02:054,48748,115,50129,110,0008,140,0002,113,536