加快在给定范围内找到倍数的算法

I'm a stumped on how to speed up my algorithm which sums multiples in a given range. This is for a problem on codewars.com here is a link to the problem I'm a stumped on how to speed up my algorithm w