-2
\$\begingroup\$

This question already has an answer here:

Would it be acceptable to ask questions here that ask for the biggest program to solve a problem, for some measure of big: characters, lines, bytes in memory etc.? And what sort of constraints would be necessary to avoid trivial near-infinite extensions of the size? For example, simply requiring that each line be unique (after trimming whitespace) and executed would still allow answers enumerating every possible function name and nesting them:

def a():
    b()

[…]

def zz[…]zz():
    print('answer')
\$\endgroup\$

marked as duplicate by a spaghetto, Alex A. Jul 13 '16 at 23:53

This question has been asked before and already has an answer. If those answers do not fully address your question, please ask a new question.

  • \$\begingroup\$ no, then you could just include very large comments or filler code that does nothing \$\endgroup\$ – noɥʇʎԀʎzɐɹƆ Jul 13 '16 at 23:06
  • 1
    \$\begingroup\$ This already exists, it's called code-bowling. It doesn't work very well though \$\endgroup\$ – a spaghetto Jul 13 '16 at 23:06
  • \$\begingroup\$ This is code-bowling but it never works well, mainly because answers always find loopholes. \$\endgroup\$ – Downgoat Jul 13 '16 at 23:08
5
\$\begingroup\$

This already exists. We have a tag called , and the wiki says:

Code-bowling is a competition to solve a particular (usually simple) problem in the most bytes or complexity.

That being said, there are 19 questions tagged with code-bowling, and 8 of them are closed. There are lot's of problems with code-bowling that make it hard to do a good code-bowling challenge. In fact, there have even been discussions about removing code-bowling from the site.

Now, that doesn't mean "Code-bowling" is off-topic (just yet), but it does mean you should be very careful before posting a code-bowling challenge. There must be some feature in the challenge that inherently restricts how long your code can get. Otherwise, submissions would just add billions and trillions of comments and NOP's, which could continue on indefinitely.

I highly recommend the sandbox before you post any challenges of this type.

\$\endgroup\$

Not the answer you're looking for? Browse other questions tagged .