I have a preconception that golfing languages are not fast running. I have no idea if this is correct for some/all golfing languages.
The reason I wonder is that if they are slower than other languages, then setting a time limit for a specific problem size on a code-golf question will mean golfing languages need to put more code into optimising for speed, and so only faster languages would be able to use a brute force approach.
Is this an interesting way of promoting competition between different languages with different strengths? Or is it better to keep challenges about one thing or the other (speed or length)?