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 19, 2026 00:41Kevin HeaveyKevin HeaveyScore: 3,610Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 19, 2026 00:473,58539,406,44128,644,0001,114,0002,113,536
2Jul 19, 2026 00:473,60339,589,66428,728,0001,177,0002,113,536
3Jul 19, 2026 00:473,60539,562,16828,747,0001,180,0002,113,536
4Jul 19, 2026 00:473,60639,714,70228,889,0001,044,0002,113,536
5Jul 19, 2026 00:473,61039,672,48128,806,0001,162,0002,113,536
6Jul 19, 2026 00:473,61539,649,85928,873,0001,132,0002,113,536
7Jul 19, 2026 00:473,86941,800,12430,969,0001,151,0002,113,536
8Jul 19, 2026 00:473,88541,812,64031,107,0001,140,0002,113,536
9Jul 19, 2026 00:473,92342,269,33531,392,0001,176,0002,113,536