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 18:35Kevin HeaveyKevin HeaveyScore: 3,648Success
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 18:413,57239,515,44428,609,0001,046,0002,113,536
2Jul 21, 2026 18:413,57242,648,08828,604,0001,047,0002,113,536
3Jul 21, 2026 18:413,58739,550,70028,729,0001,045,0002,113,536
4Jul 21, 2026 18:413,59939,704,72828,823,0001,049,0002,113,536
5Jul 21, 2026 18:413,64842,641,13629,234,0001,048,0002,113,536
6Jul 21, 2026 18:413,65042,736,86829,251,0001,046,0002,113,536
7Jul 21, 2026 18:413,69340,520,65129,606,0001,047,0002,113,536
8Jul 21, 2026 18:413,79641,518,09230,465,0001,043,0002,113,536
9Jul 21, 2026 18:413,83741,791,11730,807,0001,044,0002,113,536