49
\$\begingroup\$

How well do you know the site? Let's find out.

This is a challenge. Robber's thread.

As a cop, you need to:

  1. Find a non-deleted, non-closed challenge on this site to answer. The challenge cannot have the following tags: , , , , , , , . The challenge must have restrictions on valid output.
  2. Write a valid submission for the challenge, in a free language found on Wikipedia or esolangs.org or tryitonline. The submission does not have to be competitive, only valid. EDIT: Hashing in your submission is not allowed
  3. Post the submission here, keeping the challenge secret. You must post the entire submission, as well as the language (and version, if applicable).

After a week, if nobody has found the challenge you are answering, you may post the challenge that your submission is answering, at which point, your submission is safe. It is worth N points, where N is the number of upvotes on the challenge (as of 2016-11-17) (Higher is better)

To crack your challenge, a robbers need to find any challenge that the submission is a valid submission for.

Notes:

  • If a challenge requires an output of X, and you output XY or YX where Y is anything besides whitespace, the submission is not valid for that challenge.
  • A challenge newer than 2016-11-17 is not allowed.
  • Languages newer than the hidden challenge are allowed.
  • I reserve the right to ban certain challenges if they are widely applicable (could be applied to the majority of all submissions).
  • Thanks to Daniel for the initial idea!

Here's a search query for valid questions.

Uncracked Submissions:

<script>site = 'meta.codegolf'; postID = 5686; isAnswer = false; QUESTION_ID = 100357;</script><script src='https://ajax.googleapis.com/ajax/libs/jquery/2.1.1/jquery.min.js'></script><script>jQuery(function(){var u='https://api.stackexchange.com/2.2/';if(isAnswer)u+='answers/'+postID+'?order=asc&sort=creation&site='+site+'&filter=!GeEyUcJFJeRCD';else u+='questions/'+postID+'?order=asc&sort=creation&site='+site+'&filter=!GeEyUcJFJO6t)';jQuery.get(u,function(b){function d(s){return jQuery('<textarea>').html(s).text()};function r(l){return new RegExp('<pre class="snippet-code-'+l+'\\b[^>]*><code>([\\s\\S]*?)</code></pre>')};b=b.items[0].body;var j=r('js').exec(b),c=r('css').exec(b),h=r('html').exec(b);if(c!==null)jQuery('head').append(jQuery('<style>').text(d(c[1])));if (h!==null)jQuery('body').append(d(h[1]));if(j!==null)jQuery('body').append(jQuery('<script>').text(d(j[1])))})})</script>

\$\endgroup\$
28
  • 2
    \$\begingroup\$ Related meta post \$\endgroup\$
    – Loovjo
    Nov 18, 2016 at 19:21
  • 1
    \$\begingroup\$ Byte counts are not required. \$\endgroup\$ Nov 18, 2016 at 19:47
  • 1
    \$\begingroup\$ There are many challenges where solutions will take much longer than an hour to compute for valid inputs. The time limit is not a good idea. \$\endgroup\$
    – user45941
    Nov 18, 2016 at 23:51
  • 2
    \$\begingroup\$ @NathanMerrill The current phrasing suggests that if there exists an input that will take an hour to compute the result for, the answer is not valid. This means basically every non-trivial challenge. \$\endgroup\$ Nov 19, 2016 at 0:00
  • 4
    \$\begingroup\$ @NathanMerrill Not feersum here, but as I've commented on Mego's submission, there's no guarantee you won't hit another hash collision before the intended one. I believe cops should have to be certain that their program is indeed the first one that matches, in which case if the cop can verify it then robbers can too. \$\endgroup\$
    – Sp3000
    Nov 19, 2016 at 4:31

35 Answers 35

1
2
0
\$\begingroup\$

Pyke, 20 bytes, SAFE, score 59

uÄCMX67+*]mA""R`.:

Try it here!

\$\endgroup\$
0
\$\begingroup\$

Pyke, 18 bytes, SAFE, score 54

2fm}s"ab"NQlZh.&|!

Try it here!

\$\endgroup\$
0
\$\begingroup\$

Pyke, 19 bytes, SAFE, score 51

4\Y:\m+Ay""%b%y"cl2

Try it here!

\$\endgroup\$
0
\$\begingroup\$

Pyke, 42 characters, SAFE, score 85

This was probably unfair as the code stopped working in the try-it link 3 days after this answer was posted. I am happy for this answer to be non-competing

cFDhkR.dۢ㒶οd-~o@l3{IoKRKn)R+(Jt~o16q*Q|

Try it here!

Subliminal message intended towards cracker.

\$\endgroup\$
6
  • \$\begingroup\$ really belongs there? \$\endgroup\$ Nov 18, 2016 at 22:07
  • \$\begingroup\$ yep and so do the other 3 unprintables \$\endgroup\$
    – Blue
    Nov 18, 2016 at 22:09
  • \$\begingroup\$ You mean 4 unprintables, right? \$\endgroup\$ Nov 18, 2016 at 22:11
  • \$\begingroup\$ yes I do - (one of them is invisible in my browser/blends in) \$\endgroup\$
    – Blue
    Nov 18, 2016 at 22:12
  • \$\begingroup\$ This doesn't seem to be a good answer to the original challenge. You're simply splitting the text into new words on each line, regardless of where the capital letters are. \$\endgroup\$ Nov 26, 2016 at 19:45
-2
\$\begingroup\$

Jelly, 1 byte, cracked

Body must be at least 30 characters; you entered 15.

\$\endgroup\$
5
  • \$\begingroup\$ Ṛ Reverse array Does not vectorize. from:github.com/DennisMitchell/jelly/wiki/Atoms \$\endgroup\$
    – tuskiomi
    Nov 18, 2016 at 20:26
  • 4
    \$\begingroup\$ codegolf.stackexchange.com/a/100370/31343 cracked? \$\endgroup\$
    – Maltysen
    Nov 18, 2016 at 20:27
  • \$\begingroup\$ If this wasn't cracked, you would have gained -22 points :p \$\endgroup\$
    – Adnan
    Nov 18, 2016 at 20:28
  • \$\begingroup\$ It's golf so -22 points is good, right? \$\endgroup\$
    – milk
    Nov 18, 2016 at 20:29
  • \$\begingroup\$ Now it's -23 points, to be exact. That one is a remnant of my immaturity stage. \$\endgroup\$ Nov 18, 2016 at 22:05
1
2

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service and acknowledge that you have read and understand our privacy policy and code of conduct.

Not the answer you're looking for? Browse other questions tagged or ask your own question.