It seems like many users who want to do a fastest-code challenge don't really think about it how they actually measure "fastness". And then usually a short discussion develops in the comments laying out two possibilities:
- Scoring by runtime on a benchmark of test cases.
- Scoring by asymptotic complexity with some tie-breaker.
I think these two goals can make for somewhat different challenges, and we might be able to avoid this discussion if we just had separate tags that clearly imply one of the two winning criteria.
What do you think about retagging the complexity-oriented ones as fastest-algorithm? Alternatively, the new tag could be a bit more general to encompass optimisation for space complexity as well.