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 21, 2026 18:44Kevin HeaveyKevin HeaveyScore: 3,686Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 21, 2026 18:543,58839,649,79628,742,0001,044,0002,113,536
2Jul 21, 2026 18:543,59339,678,59528,587,0001,239,0002,113,536
3Jul 21, 2026 18:543,60039,732,89528,829,0001,051,0002,113,536
4Jul 21, 2026 18:543,60941,708,52228,910,0001,045,0002,113,536
5Jul 21, 2026 18:543,68640,459,05529,555,0001,046,0002,113,536
6Jul 21, 2026 18:543,80241,564,44730,513,0001,044,0002,113,536
7Jul 21, 2026 18:543,87645,640,50631,132,0001,043,0002,113,536
8Jul 21, 2026 18:543,91346,004,88531,434,0001,047,0002,113,536
9Jul 21, 2026 18:543,92443,473,40031,530,0001,042,0002,113,536