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 listFeb 24, 2026 13:55SneedSneedScore: 12,965Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 24, 2026 13:5512,961132,666,552106,572,0001,005,0002,277,376
2Feb 24, 2026 13:5512,964134,707,260106,593,0001,005,0002,277,376
3Feb 24, 2026 13:5512,964138,639,929106,595,0001,005,0002,531,328
4Feb 24, 2026 13:5512,965138,255,155106,605,0001,005,0002,523,136
5Feb 24, 2026 13:5512,965138,749,456106,608,0001,005,0002,285,568
6Feb 24, 2026 13:5512,975134,279,056107,694,00002,285,568
7Feb 24, 2026 13:5512,980133,559,734106,735,000997,0002,523,136
8Feb 24, 2026 13:5512,980136,386,336106,738,000997,0002,285,568
9Feb 24, 2026 13:5512,982137,709,189105,757,0001,995,0002,531,328