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 17, 2026 00:57Kevin HeaveyKevin HeaveyScore: 3,865Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 17, 2026 01:023,74040,750,88929,993,0001,050,0002,113,536
2Jul 17, 2026 01:023,75640,940,97830,126,0001,049,0002,113,536
3Jul 17, 2026 01:023,75740,991,58330,132,0001,057,0002,113,536
4Jul 17, 2026 01:023,76841,050,50630,227,0001,052,0002,113,536
5Jul 17, 2026 01:023,86542,002,63231,031,0001,051,0002,113,536
6Jul 17, 2026 01:023,98344,568,03732,041,0001,025,0002,113,536
7Jul 17, 2026 01:023,98843,061,17132,056,0001,045,0002,113,536
8Jul 17, 2026 01:024,00343,678,92832,184,0001,047,0002,113,536
9Jul 17, 2026 01:024,04043,285,46932,496,0001,044,0002,113,536