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 listAug 28, 2026 05:37Victor MerckléVictor MerckléScore: 11,811Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 28, 2026 05:3711,485103,723,67194,245,0001,088,0002,113,536
2Aug 28, 2026 05:3711,496103,933,33094,297,0001,126,0002,113,536
3Aug 28, 2026 05:3711,522104,046,49194,520,0001,113,0002,113,536
4Aug 28, 2026 05:3711,800106,343,00896,871,0001,075,0002,113,536
5Aug 28, 2026 05:3711,811107,100,93996,963,0001,076,0002,113,536
6Aug 28, 2026 05:3711,817106,458,17297,013,0001,074,0002,113,536
7Aug 28, 2026 05:3711,820106,520,98597,000,0001,113,0002,113,536
8Aug 28, 2026 05:3711,914107,262,91897,797,0001,097,0002,113,536
9Aug 28, 2026 05:3712,118109,306,43999,500,0001,084,0002,113,536