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 21, 2026 09:08Kevin HeaveyKevin HeaveyScore: 3,797Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 21, 2026 09:103,76740,931,61829,210,0002,059,0002,113,536
2Jul 21, 2026 09:103,76840,960,73029,229,0002,052,0002,113,536
3Jul 21, 2026 09:103,78341,080,61129,348,0002,057,0002,113,536
4Jul 21, 2026 09:103,78741,078,10929,415,0002,020,0002,113,536
5Jul 21, 2026 09:103,79741,119,73329,284,0002,239,0002,113,536
6Jul 21, 2026 09:103,80541,235,17629,298,0002,284,0002,113,536
7Jul 21, 2026 09:103,80941,227,53729,476,0002,141,0002,113,536
8Jul 21, 2026 09:103,91342,083,14130,325,0002,156,0002,113,536
9Jul 21, 2026 09:104,08044,141,89431,682,0002,185,0002,113,536