Find the smallest prime from a substring has the answer with the negative score -18 due to 50 points bonus for languages without prime-related functions.
A score is typically a length in bytes or Unicode codepoints.
Is there an answer that has smaller score (among all answers to all code-golf questions)?
This is a first stab at querying for that information via StackExchange Data Explorer.
It is not easy data to isolate, because some languages are named with a -[number] pattern in them (Befunge-93, Modula-2, etc.) and because many users will list their positive scores thusly:
Haskell-36 chars
So it's merely a start, a proof if you will that because the golf scores are part of the message body it is not a simple matter to decompose the data you seek.
Still, this should give you something to play with. You can probably zero in closer by restricting the query to only the code golf tag and tweaking the query with more NOT LIKE exceptions.
And if any of the Meta crowd can think of some genuinely useful things that the data might be able to tell us about the site, as the resident SQL nerd I am willing to build queries toward that end. As long as it doesn't depend on munging the post body into useful data, there's a lot that Data Explorer makes it possible to learn.
I think there's a good chance that it's an answer of mine which scores -93 points. I think this illustrates a flaw in your suggestion in a comment that bonuses allow comparing skill instead of language capabilities: the -100 bonus for not using a built-in sort is far more than enough to make it worthwhile implementing a sort in a golf-friendly language.
sort()).
\$\endgroup\$