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 25, 2025 14:26VladislavVladislavScore: 65,276Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 25, 2025 14:2565,197567,132,841540,135,0001,000,0002,285,568
2Aug 25, 2025 14:2665,265564,335,541539,705,0001,998,0002,285,568
3Aug 25, 2025 14:2565,266566,649,343539,710,0001,998,0002,285,568
4Aug 25, 2025 14:2565,268564,664,460539,728,0001,998,0002,285,568
5Aug 25, 2025 14:2565,270563,391,170540,739,000999,0002,285,568
6Aug 25, 2025 14:2565,270568,373,161539,739,0001,999,0002,285,568
7Aug 25, 2025 14:2665,276567,690,422539,788,0001,999,0002,285,568
8Aug 25, 2025 14:2565,278564,461,769539,805,0001,999,0002,269,184
9Aug 25, 2025 14:2565,283569,144,025540,852,000999,0002,265,088
10Aug 25, 2025 14:2665,288563,386,789539,893,0001,999,0002,285,568
11Aug 25, 2025 14:2565,311570,212,596541,083,0001,000,0002,277,376
12Aug 25, 2025 14:2565,320568,527,476542,152,00002,285,568