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 listDec 21, 2025 10:40Mark R BestMark R BestScore: 80,559Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 21, 2025 10:4080,171689,165,092434,623,000230,800,0002,273,280
2Dec 21, 2025 10:4080,231695,793,494435,944,000229,970,0002,351,104
3Dec 21, 2025 10:4080,255695,385,552435,422,000230,694,0002,449,408
4Dec 21, 2025 10:4080,500699,620,073435,099,000233,053,0002,453,504
5Dec 21, 2025 10:4080,559690,514,313434,764,000233,873,0002,285,568
6Dec 21, 2025 10:4080,656693,295,143433,640,000235,804,0002,273,280
7Dec 21, 2025 10:4080,720703,465,702435,984,000233,991,0002,482,176
8Dec 21, 2025 10:4080,966700,226,885435,362,000236,653,0002,285,568
9Dec 21, 2025 10:4081,038696,685,160435,753,000236,865,0002,383,872