I'm just curious about any pure code golf questions (ie, not ones that build on other answers, just straight up, solve the problem with fewest bytes) where even the shortest golfed answers (especially in golf languages) are particularly long.
Do any problems stand out as ones that were particularly ungolfable? (Preferably not because they have large datasets which would need to be incorporated in the answers somehow...)
TL;DR: Of the pool of correct, shortest answers to a pure code golf non-kolmogorov-complexity problem, answered in a golf language, which are some of the longest?