Multiples of 3 and 5, problem 01 on Project Euler, asks us to find the sum of all multiples of 3 or 5 below 1000.
@time begin
filter(k -> k % 3 == 0 || k % 5 == 0, 1:999) |> sum
end
> 0.028008 seconds (22.72 k allocations: 1.240 MiB, 98.94% compilation time)
>
> 233168