With the recent surge of golf posts, i was interested in the tricks that would come up. So i decided to copy/paste the solutions to a few different golfs into a file and set up a run or two. The first time i tried this, i was disturbed that nothing happened. After further searching i found that some of the algorithms provided in golf are so slow that they can cause machine-grinding halting for any large problem space.
My general inquiry then is: Would people be interested in a golf problem that asked for a reduction of time to solve the problem? There would be no need for a formal proof of shortness, just a listing of the benchmark or some such. i've seen merlyn and others stating sometimes one solution is better than another because it uses fewer instructions. This type of golf would be the extreme of that type of thinking, and best solutions would usually not include recursion and extraneous loops.
Methinks it's an interesting idea and worth consideration since often it's more worthwhile to optimize code than it is to shrink it's size. As a tag for the posts' title i thought of maybe [frisbee golf], but that's subject to change...