We've got a fairly old challenge about the Kolakoski sequence. Unfortunately, the challenge is fairly restrictive in its I/O requirements: in particular, input has to be taken via command-line argument. This prevents most esolangs from competing entirely, which I think is a shame for such a popular (and fun) integer sequence.
Should we post a new version of this challenge, which allows all of our standard I/O methods to allow all languages to participate? While we're at it, we could also relax the output requirements to the recent trend of letting the answerers choose between a) given n output a(n), b) given n output the first n terms and c) print the sequence indefinitely.
The old challenge could either be closed as a duplicate of the new one, or it could be merged into the new one as all the old answers would still be valid. However, they'd likely all be suboptimal (except in languages where reading from command-line arguments is shortest anyway). Since there are only 11 answers, I don't think it's a big deal either way.
(Of course, we could just edit the old challenge, but the OP doesn't seem to want to make this change, specifically because it would make the existing answers unnecessarily suboptimal.)