What about, for the first challenge, sorting a list of length 256 without builtins?
Sounds good! How about this? Your program must sort 10 times a random list of length 256. After that, your score will be time in seconds*size in bytes. The lower your score, the better.
For more challenges, it seems fine to create programs that replaces such build-in functions