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 listMay 6, 2026 15:14Dominique GarmierDominique GarmierScore: 6,737Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 6, 2026 15:146,65872,177,76954,244,0001,019,0002,473,984
2May 6, 2026 15:146,67371,180,20954,197,0001,192,0002,473,984
3May 6, 2026 15:146,69973,092,07454,397,0001,207,0002,465,792
4May 6, 2026 15:146,73372,029,07854,682,0001,204,0002,465,792
5May 6, 2026 15:146,73771,790,74454,741,0001,182,0002,457,600
6May 6, 2026 15:146,73976,155,64254,742,0001,195,0002,473,984
7May 6, 2026 15:146,75573,757,85254,883,0001,189,0002,465,792
8May 6, 2026 15:146,78573,880,54455,068,0001,255,0002,469,888
9May 6, 2026 15:146,78874,405,93555,215,0001,126,0002,478,080