Most involvement in an answer/answers
Partial repost of 2019
For an answer or multiple answers where multiple people were involved. This could be multiple people helping out a user on a single answer, or a back-and-forth between two or more answers trying to outgolf each other.
(Nominated by user)
First Giuseppe posted a 60 byte answer. Robin Ryder, being sportsmanlike, suggested a 47 byte alternative (a whopping -13 bytes!), and Giuseppe golfed that further to 44.
Then Robin Ryder had another idea, and this time they posted their own 41 byte answer using a different approach, now the shortest R answer.
Suddenly, Dominic Van Essen swooped in with a 35 byte answer, shocking everyone! Robin Ryder heroically countered with a last minute 33-byter, but alas, it was in vain, for Dominic Van Essen changed directions and made it to the 28 byte mark, where Dom Hastings and caird coinheringaahing carried the exhausted R Rainbow champion to the 26-byte line!
(self nomination by Lyxal)
This was a fun little exchange of cop and robber answers for which HighlyRadioactive provided cop answers in ><> and which I promptly cracked. The irony about this chain is that the intended answers were much shorter than what I came up with. I don't think anyone else engaged in such a long challenge chain.
It started off with HighlyRadioactive (hereby referred to as HR) posting an easy enough first cop (which required usage of
o), which I swiftly cracked. HR shot back with the second cop, which barred numbers, making constants harder to push to the stack. But with the power of colons,
+s, it was cracked by me.
Round three was just another restriction of constants (the length operator this time), but that was easily circumnavigated using ASCII character codes. Round four introduced a slight inconvenience into the works (by banning something that would make constants more tedious to produce) - something which I responded by getting creative and using the fact that -1 is returned when there is no input.
Round five ruined that previous approach, but I still had ASCII characters up my sleeve, so the games continued.
Then came round six. I probably shouldn't have made the whole entire ASCII stuff obvious because HR barred that too. For a while, I was at a loss on how to even generate any form of number on the stack - I had no numbers, no literals and everything else that pushed a number was banned. But I wasn't about to give up. Desperate to find something to use, I looked at the command line flags to see what I could potentially twist to the purposes of making something out of nothing. Then I saw it... the
-v interpreter flag which allows one to pre-initialise the stack with values. I got straight to work, typing up 649 colons, plus symbols and
ns all by hand on a 5-inch phone. The ball now once again laid in HR's side of the court.
In a some-what anti-climatic twist, round seven allowed the usage of a constant again - promptly cracked.
Round eight was posted, I cracked it using the usual approach, but due to technicalities, it wasn't technically accepted. Regardless, there was still a response to the last challenge.
And so that is the story of probably the longest chain of cracking to the challenge Print X without X
(Self-ish nomination by user)
Luis Mendo posted a 42 byte MATL answer, and then Razetime posted a 61 byte APL answer that ovs golfed to 56 bytes. I proposed a 40 byte alternative, to which Razetime replied that it beat MATL. At that, Luis Mendo got their answer to 38 bytes. Razetime took 3 more bytes off of their answer. When Luis Mendo was informed of this, they got their answer to 31 bytes, outgolfing even the 32 byte Jelly answer. Razetime and I both shaved off a few bytes each, getting their answer to 32 bytes, but by then, Luis Mendo had already gotten their answer to 29 bytes! Then I posted my own 31 byte answer based off of Razetime's, and eventually got it down to 26 bytes with @ngn's help.