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 22, 2026 15:43Kevin HeaveyKevin HeaveyScore: 3,565Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 22, 2026 15:443,53338,937,04028,242,0001,084,0002,113,536
2Jul 22, 2026 15:443,55639,184,99628,402,0001,114,0002,113,536
3Jul 22, 2026 15:443,55739,163,54228,404,0001,121,0002,113,536
4Jul 22, 2026 15:443,56242,915,75628,465,0001,107,0002,117,632
5Jul 22, 2026 15:443,56539,789,35828,443,0001,153,0002,113,536
6Jul 22, 2026 15:443,57839,390,14328,653,0001,045,0002,113,536
7Jul 22, 2026 15:443,59039,502,37228,637,0001,165,0002,113,536
8Jul 22, 2026 15:443,77441,126,44330,200,0001,130,0002,113,536
9Jul 22, 2026 15:443,82741,776,53630,648,0001,122,0002,113,536