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 01:47Victor MerckléVictor MerckléScore: 4,698Success
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 01:474,61547,395,85837,192,0001,120,0002,113,536
2Aug 27, 2026 01:474,67147,189,92737,657,0001,120,0002,113,536
3Aug 27, 2026 01:474,69147,312,44637,836,0001,104,0002,113,536
4Aug 27, 2026 01:474,69447,338,05037,863,0001,098,0002,113,536
5Aug 27, 2026 01:474,69847,375,18637,887,0001,110,0002,113,536
6Aug 27, 2026 01:474,71047,542,38437,997,0001,104,0002,113,536
7Aug 27, 2026 01:474,72647,647,72538,200,0001,029,0002,113,536
8Aug 27, 2026 01:474,73455,525,37538,282,0001,011,0002,113,536
9Aug 27, 2026 01:474,80548,197,35738,786,0001,102,0002,113,536