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:58Kevin HeaveyKevin HeaveyScore: 3,561Success
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:593,53839,100,17328,273,0001,096,0002,113,536
2Jul 22, 2026 15:593,54839,088,46428,346,0001,109,0002,113,536
3Jul 22, 2026 15:593,55039,091,49428,332,0001,140,0002,113,536
4Jul 22, 2026 15:593,56039,212,71128,442,0001,111,0002,113,536
5Jul 22, 2026 15:593,56139,218,45728,437,0001,120,0002,113,536
6Jul 22, 2026 15:593,56239,178,34828,479,0001,087,0002,113,536
7Jul 22, 2026 15:593,58839,542,06128,634,0001,148,0002,113,536
8Jul 22, 2026 15:593,74346,045,95129,896,0001,178,0002,113,536
9Jul 22, 2026 15:593,81041,585,04230,506,0001,124,0002,113,536