Concatenative counting source-layout code-challenge number Your challenge is to write N snippets of code such that, when you concatenate the first K together, they produce the number K. The higher N, the better. Here's the catch: you may not use any character more than once across your snippets...

Given a string that consists entirely of printable ASCII, convert all lowercase letters to their uppercase equivalent. Non-lowercase characters are left untouched. I am not going to outright ban builtin solutions, but if you are going to post a solution that uses the builtin, please also post on...

(This is my first code-golf question) When I was a child, my dad and I invented a game where the license plate we see on cars can give certain points based on some rather simple rules: X amount of the same letter or number give X-1 points, examples: 22 = 1 point aa = 1 point 5555 = 3 points ...

"Sign Cricket" scores Sign Cricket is a game played on long car journeys (although recently with more travel taking place on motorways, less so). Points are earned for the number of legs described by the name of the pub, where the name includes an item that typically has legs, except if the name...

Sales taxes in the United States are complicated, to say the least. Generally, there's a state sales tax (there are a handful of states that do not collect a state sales tax), but there could also be a county sales tax, a school district sales tax, a municipal (city) sales tax, or a metropolitan ...

The eso-lang Brainfuck only has 8 instructions that do something: +-><[],. so in theory you could represent them in 3 bits. You could store 8 instructions in 24 bits or 3 bytes. BrnFck This is compressed brainfuck an instruction will be represented by its bits. + : 000 - : 001 > : 010 < : 011...