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 27, 2026 18:49Victor MerckléVictor MerckléScore: 3,816Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 27, 2026 18:503,80039,835,98530,520,0001,020,0002,113,536
2Aug 27, 2026 18:503,80839,912,00730,332,0001,280,0002,113,536
3Aug 27, 2026 18:503,81539,986,38430,462,0001,204,0002,113,536
4Aug 27, 2026 18:503,81540,718,85530,650,0001,019,0002,113,536
5Aug 27, 2026 18:503,81640,076,66630,632,0001,046,0002,113,536
6Aug 27, 2026 18:503,81740,053,74430,651,0001,032,0002,113,536
7Aug 27, 2026 18:503,82040,738,77730,449,0001,263,0002,113,536
8Aug 27, 2026 18:503,82840,654,58730,746,0001,031,0002,113,536
9Aug 27, 2026 18:503,83940,800,94330,568,0001,296,0002,113,536