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 18, 2026 12:34Kevin HeaveyKevin HeaveyScore: 3,842Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 18, 2026 12:473,66540,189,84529,382,0001,045,0002,113,536
2Jul 18, 2026 12:473,70840,589,67929,735,0001,049,0002,113,536
3Jul 18, 2026 12:473,71740,688,53029,806,0001,051,0002,113,536
4Jul 18, 2026 12:473,74740,920,69330,056,0001,047,0002,113,536
5Jul 18, 2026 12:473,84241,688,45630,852,0001,044,0002,113,536
6Jul 18, 2026 12:473,90842,328,13531,391,0001,047,0002,113,536
7Jul 18, 2026 12:473,90942,241,45131,401,0001,045,0002,113,536
8Jul 18, 2026 12:473,98542,923,64332,037,0001,041,0002,113,536
9Jul 18, 2026 12:474,01143,159,27232,256,0001,042,0002,113,536