Assembly capture-the-flag KotH king-of-the-hill machine-code In this KotH, you'll write a program in a custom machine code (or using one of a few provided languages that compile into it) which tries to run a claim function as many times as possible to collect points. However, all submissions run...

In the UTF-8 encoding bytes of the Form 10****** can only appear within multi-byte sequences, with the length of the sequence already being determined by the first byte. When UTF-8 text is split within a multi-byte UTF-8 character sequence, this prevents that the second part of the sequence is wr...

What is you language best at? There is only a finite number of operations you can do with a given number of bytes, different languages chose to assign different meanings to this operations. This means that operations that take only a few bytes in one language might take hundreds of bytes in anoth...

How Turing complete is you language Find the maximum number of disjoint (ignoring new-lines) subsets of you language that are Truing complete. Syntax characters In some languages, specific characters without any direct semantic meaning are required in every non-trivial statement, for instance in ...

Worst algorithm for anything Now, any coder worth their salt will know how to sort an array in-place in nlogntime. Most can probably figure out a way to do it in n!n time and factorial memory usage. Let's see an algorithm that tops those numbers; can you come up with a way to sort an array in up-...

Hashers and Crashers What a secure hash! Related, but hashes numbers instead of strings and uses a different scoring system. Definitions A hash collision is when two different strings produce the same hash. Summary In this challenge, the cops will make a hash function, with a collision they know...

Sometimes, in a challenge you might want to create some variations. You might want to encourage some extra constraint or limitation, but don't want to obligate everyone to attempt the extra difficulty, especially if you want to encourage using esolangs. The versions may still be too similar to po...

This is the cops thread of this cops and robbers challenge. The robbers thread is pending creation. Definitions A hash collision is when two different strings produce the same hash. Summary In this challenge, the cops will make a hash function, with a collision they know of. Then, the robbers wil...

*This is the robbers thread of this cops and robbers challenge. The cops thread is here. Definitions A hash collision is when two different strings produce the same hash. Summary In this challenge, the cops will make a hash function, with a collision they know of. Then, the robbers will try to cr...

Given a sequence of integers with length \$L\$ and an integer \$1 \le N \le L\$, an "\$N\$-rich" permutation is one whose the longest strictly increasing subsequence has length exactly \$N\$. For example, let our sequence be [0, 1, 2, 3]. There is exactly one \$1\$-rich permutation, given by [3, ...