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 18, 2026 18:24Kevin HeaveyKevin HeaveyScore: 3,926Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 18, 2026 18:353,68240,363,21929,510,0001,054,0002,113,536
2Jul 18, 2026 18:353,70540,586,03529,706,0001,053,0002,113,536
3Jul 18, 2026 18:353,80041,405,46030,499,0001,044,0002,113,536
4Jul 18, 2026 18:353,84041,713,46330,767,0001,109,0002,113,536
5Jul 18, 2026 18:353,92642,388,73331,434,0001,159,0002,113,536
6Jul 18, 2026 18:353,92842,447,72831,560,0001,045,0002,113,536
7Jul 18, 2026 18:353,94442,524,89931,695,0001,045,0002,113,536
8Jul 18, 2026 18:353,97242,790,43431,930,0001,043,0002,113,536
9Jul 18, 2026 18:354,00543,086,08832,202,0001,044,0002,113,536