Unscramble the Source Code

Question

Note: This challenge is now closed to new cop submissions. This is to ensure that no one can post submissions that only remain uncracked because there aren't enough robbers interested in the challenge anymore.

In this game of cops-and-robbers, each cop will write a simple program to give a single output. They will then make public four things about their program:

1. The language
2. The program length
3. The desired output
4. A scrambled-up version of the source code

Then, the robbers must unscramble the source code so that their program functions like the original.

---

Cop Rules

You are to write a simple program, which the robbers will try to recreate.

Your original program must have a simple functionality: upon execution, it outputs a single string/number and halts. It should give the same output regardless of when/where it is run, and should not depend on extra libraries or the internet.

Your program and output must use printable ASCII (newlines and spaces allowed). The output should be no more than 100 characters long, and the program should take less than about 5 seconds to run on a reasonable machine. You are also not allowed to use hashing (or other cryptographic functions) in your program

Then, you provide a scrambled-up version of the source code and the required output. You can scramble up your source code however you may like, as long as characters are conserved.

Your score is the shortest program you have submitted which hasn't been cracked. After a period of one week, an uncracked submission will become immune. In order to claim this immunity, you should edit your answer to show the correct answer. (Clarification: Until you reveal the answer, you are not immune and can still be cracked.) The lowest score wins.

Simple Example Cop Answers

Perl, 20

ellir"lnto Wo d";prH

Hello World

Or...

Perl, 15

*3i)xp3rn3*x3t(

272727

Robber Rules

Robbers will post their cracking attempts as answers in a separate thread, located here.

You have one attempt at cracking each submission. Your cracking attempt will be an unscrambled version of the source code. If your guess matches the description (same characters, output, and of course language), and you are the first correct guess, then you win a point. It is important to note that your program does not have to exactly match the original, simply use the same characters and have the same functionality. This means there could be more than one correct answer.

The robber with the most points (successful cracks) wins.

Simple Example Robber Answers

Your program was print "Hello World";. (Although print"Hello World" ; could have also worked.)

Your program was print(3**3x3)x3

Safe Submissions

1. ASP/ASP.Net, 14 (Jamie Barker)
2. Befunge-98, 15 (FireFly)
3. GolfScript, 16 (Peter Taylor)
4. CJam, 19 (DLosc)
5. GolfScript, 20 (user23013)
6. Perl, 21 (primo)
7. Python, 23 (mbomb007)
8. Ruby, 27 (histocrat)
9. SAS, 28 (ConMan)
10. Ruby, 29 (histocrat)
11. Python, 30 (mbomb007)
12. JavaScript, 31 (hsl)
13. Ruby, 33 (histocrat)
14. Marbelous, 37 (es1024)
15. Ruby, 43 (histocrat)
16. PHP, 44 (kenorb)
17. Ruby, 45 (histocrat)
18. Marbelous, 45 (es1024)
19. Python 2, 45 (Emil)
20. PHP, 46 (Ismael Miguel)
21. Haskell, 48 (nooodl)
22. Python, 51 (DLosc)
23. Python, 60 (Sp3000)
24. Python 2, 62 (muddyfish)
25. JavaScript, 68 (Jamie Barker)
26. Mathematica, 73 (Arcinde)
27. Haskell, 77 (proudhaskeller)
28. Python, 90 (DLosc)
29. C++, 104 (user23013)
30. ECMAScript 6, 116 (Mateon1)
31. C++11, 121 (es1024)
32. Grass, 134 (user23013)
33. PowerShell, 182 (christopherw)

Unsolved Submissions

In order of time of posting. This list courtesy of many users.

• CoffeeScript, 96 (soktinpk)
• Python 3, 70 (Sp3000)
• TinyMUSH 3.1, 20 (Muqo)
• GolfScript, 32 (Beta Decay)
• Python 2, 101 (Mateon1)
• Lua, 49 (ChipperNickel)
• Python, 61 (imallett)
• Java 6+, 218 (nhahtdh)
• CJam, 51 (Martin Büttner)
• J, 22 (FireFly)
• Marbelous, 106 (es1024)
• Marbelous, 107 (es1024)
• JavaScript, 79 (FireFly)
• CJam, 47 (user23013)
• Rust, 118 + Clojure, 106 + others (Vi.) - version 2
• Marbelous, 144 (es1024)
• Python 2, 80 (MrWonderful)
• Perl, 53 (DLosc)
• Perl, 26 (primo)
• Mathematica, 31 (Arcinde)
• Marbelous, 144 (es1024)
• Assembly, 78 (krzygorz)
• J, 14 (algorithmshark)
• Java 8, 157 (TheBestOne)

A small tool to verify solutions, courtesy of n̴̖̋h̷͉̃a̷̭̿h̸̡̅ẗ̵̨́d̷̰̀ĥ̷̳

$(function(){function e(){var e=$("#ignore-space").is(":checked");var t=$("#source").val().split("").sort();var n=$("#editor").val().split("").sort();var r,i=0;for(r=0;r<t.length;){if(t[r]==n[i]){t.splice(r,1);n.splice(i,1)}else if(t[r]>n[i]){i++}else{r++}}$("#display").val(t.join(""));n=n.join("");if(e){n=n.replace(/[\r\n\t ]/g,"")}if(n.length!=0){$("#status").addClass("bad").removeClass("good").text("Exceeded quota: "+n)}else{$("#status").addClass("good").removeClass("bad").text("OK")}}$("#source, #editor").on("keyup",function(){e()});$("#ignore-space").on("click",function(){e()});e()})

textarea{width:100%;border:thin solid emboss}#status{width:auto;border:thin solid;padding:.5em;margin:.5em 0}.bad{background-color:#FFF0F0;color:#E00}.good{background-color:#F0FFF0;color:#2C2}

<script src="https://ajax.googleapis.com/ajax/libs/jquery/1.11.1/jquery.min.js"></script>
<h3>Scrambled Source</h3>
<textarea id="source" class="content" rows="10"></textarea>
<h3>Unused Characters</h3>
<textarea id="display" class="content" rows="10" readonly></textarea>
<h3>Your Solution</h3>
<input type="checkbox" id="ignore-space" name="ignore-space"/>
<label for="ignore-space">Ignore space characters</label>
<div id="status" class="good">OK</div>
<textarea id="editor" class="content" rows="10"></textarea>

Answer 1

JavaScript, 73

Code

console.log((((((('[[.....=-,,]]'+'02aaceeeeeefiiijllopprrrrssttv')))))))

Output

denied

Answer 2

Python 3, size 44 [cracked by feersum]

Scrambled:

print(((((((((((((()))))))))))))),,<<<<<<<~~

Output:

3

I'm trying to make Python look more like LISP.

---

Explanation

This one relies on Python's use of implicit conversion. ()<((),) evaluates to True, and applying << [bitshift] implicitly converts True to 1.

Answer 3

GolfScript, 20 bytes [safe]

Code

...[[]]{{}}&%%++++5i

Output

32

Output does not have a newline character in the end.

Inspired by this comment.

Solution

.{5i[+]+}.%{}++[.%]&

Answer 4

CJam, 19 (Cracked)

Code

JJ2334567899#%**~""

Output

500827930823087774653348

Answer 5

Grass, size 134 [safe]

Code

WWWWwwWwWwWWWwWWWWwwwWwWwwwWwwwwwWWwWwwWwWWwWwwWWwwwwWwwwwWwwwWWwwwWwwwWWwwwWWWWWWWWwwWWwwwWwWWWWWwWWWwWWwwwwWWWwwWWwwwWwWWWwWwwwWWWWW

Output

wwwwwwwwwwwwwww

Tested in the Python interpreter.

Solution

wWWWwwwwWwwwwwWwWwwwwwWwwwwwwwwWWwWWWwWWWWwWWWWWWwwwwwwWwwwwwwWwwwWWwWWWwWWWWwWWWWWWwwwwwwWwwwwwwWwwwWWwWWWwWWWWwWWWWWwWWWWWWwWWWWWWWw

I wonder if anyone has tried...

Answer 6

Python 2 - 61 Cracked

Code

r~s]l][]:.c[():sit_'3-'(pt_trp.l]2-~n:][.i':o:p0Te[d_u1[.')i_

Output

get

Original

print''.__doc__[::2][::3].split()[1].split('.')[0][:-~-~True]

Answer 7

PHP, size 23 [Cracked]

Code

echo@$b=$b.$c,$c=$c.$c;

Output

bbbbb

Answer 8

JavaScript, length 32 (cracked)

alert('HaVobp'.match(/[HaVt]+/))

Output

puGiXm

Answer 9

CJam, size 19 (Cracked)

Code

"Can't touch this!"

Output

hunt 12tacos

(Probably not as difficult as the last one, but I had to post a sequel.)

Answer 10

Golfscript, 32

Code

  *++..0011125::::;;;?bbbbcccc{}

Output

1993841993677373809355710590420516863199384199367737380935571059042051686311

Answer 11

C, 70 (Cracked)

Code

C='g'-pf;main(hx){ok,the(hot)Cake isA lie;forC*-g.=+:;prntf("%d",40);}

Output

40135

Original Solution

main(h,r){float C=h;ek:C+=0xA.ep4;if(h--)goto ek;printf("%g",C*'sd');}

Answer 12

CJam, 34 bytes (cracked)

Scrambled source

""Beware the Jabberwock, my son!""

Output

1.0245778622239579

Answer 13

Ruby, 35

Code

}||{yyssplliihhddaa____][>====:.-)(

Output

shadilyshadily

Answer 14

JavaScript, 69 Cracked by FireFly

Code

grr('action rat')''(((())))*++++00001122333355566677====S[[]]ffffffxx

Output

"nananananananananananana batman"

Run in browser console (string result is REPL), tested in Chrome 38, Firefox 33, and IE11

Answer 15

Ruby, 43

Code

*+89*:%t(|in set{2e0--1e2}|*.prime?<~1)(25)

Output

11010100010100010100010000010100000100010100010000010000010100000100010100000100010000010000000100

Hint

The scrambled code (after the first few characters) describes the output. For each number in the set of natural numbers between 2e0 and 1e2 (2 to 100), output a 1 if it's prime and a 0 otherwise, for 25 primes in total.

Original Code

98.times{|e|print (2**e*~-5-1)%(e+2)<2?1:0}

Explanation

I learned this trick from leonid's answer on an Anarchy Golf problem. The code doesn't actually do a valid prime check, it uses the Fermat Primality Test in base 2, which is probabilistic but is correct up to 341 or so.

Answer 16

C++11, size 104 [safe]

Code

<<<<<<==>>  ,,,,,,;;:::::?.""(){}\&&##07aabcccccddddddeeeeehiiiiillllllmmnnnnooorrsssssttttttttttuuuux

And two newlines.

Compiled with g++ --std=c++11.

Output

hello
hello
hello
hello
hello
hello
hello
hello
hello
hello

I thought I should have printed something better than hello.

Solution

#include<iostream>#\><

struct u{int t=std::cout<<"hello"<<std::endl&&7;}l,d,s,c,b,main=d.t?exit(0),l:c;

Someone please explain how it works to me...

Answer 17

PHP, 53 (Cracked)

Code

o3o5do=++,"oodr=f(+$fni9$d;$9=d9$$%rp7<o$t=$);$,")5(;

Output

571349220413226117734422843528553434864141775449210755731225661136475615328581707

Answer 18

PowerShell 182 [safe]

but definitely not the winner

''-join%{[char]};;|$()$a$a$a$c$c$c$_===+;    0-82,-82,-75,-70,-68,-68,-65,-15,-11,-11,-11,-11,-9,-7,-7,-7,-6,-6,-6,-2,-1,-1,0,1,1,7,8,8,8,11,13,13,13,15,21,25,48,65,79,80,80,80,80,80

Output

Peter Piper picked a peck of pickled peppers

Solution

$a = 0;$(80,21,15,-15,13,-82,48,25,7,-11,13,-82,80,-7,-6,8,-6,-1,-68,65,-65,80,-11,-2,8,-75,79,-9,-70,80,-7,-6,8,1,-7,-1,-68,80,-11,11,0,-11,13,1|%{$c=$a+$_;$a=$c;[char]$c}) -join ''

Answer 19

JavaScript, 79 bytes [safe]

Another one, for fun. Might be similar to Shawn's 69 (at least I got the idea while working on it and not succeeding). Outputs using alert, which is already unscrambled for your convenience.

Code

alert(0123)
//((((()))))++...3566777===[[[\]]]
//accefffgggghhhhiiklmnnoorrstuw

Output

underhanded

Hint

Here's a hint: think of substitution ciphers.

Solution

for(f
in(g=/56732106737/.source+(h=[])))h+=g.link().match(/\w/g)[g[f]]
alert(h)

The digits in the regex pattern correspond to indices in the string g.link() aka <a href="undefined">56732106737</a>. "underhanded" uses only characters reachable by indexing with single-digit numbers into this string (most from "undefined").

Answer 20

JavaScript, 31 bytes (SAFE)

Code

'([(102)])prenatal.gecko'tonsil

Output

j

Should work in any browser console, although it is a standalone program.

Original source

alert('0acegnos'.link(top)[12])
The characters in the string are red herring, so it wouldn't be obvious what functions were used. It uses the little-known link function, which makes an HTML <a> element. The top object is converted to a string as [object Window], and added as the <a> link, the twelfth character of which is j.

Answer 21

Perl - 26 bytes (cracked by choroba)

p:rlq{not goto p,if$a>=$b}

Output

potato

Answer 22

CJam, size 15 (Cracked)

Code

6789%%%++:,{{}}

Output

882

Answer 23

Coffeescript - 96

There might be more than one way to solve this one. It's also pretty long, but hopefully it will survive cracking for a while.

Output:

5299944725070263763912242111215369742359896456157909233296841284031194827848086

Program characters: (note \n is a newline and \s is a space):

j\n][j9\sa='';]4j90].[.[i\n1].=iaa[]e]9i[9\sa]\s9t][ia2]n.8v\nan.fa=ar%,i\s1%=l+o.\s[09[j],+v%[\sroj,[9i.

Or without \n and \s:

j
][j9 a='';]4j90].[.[i
1].=iaa[]e]9i[9 a] 9t][ia2]n.8v
an.fa=ar%,i 1%=l+o. [09[j],+v%[ roj,[9i.

Answer 24

CJam, size 52 (cracked)

Code

,,,,,;::::'""))@*\&%+++++333333333333333333ccffffffm

Output

0!1"2#3$4%5&6'7(8)9*10+11,12-13.14/15016117218319420521622723824925:26;27<28=29>30?31@32A

Answer 25

Java - 70 bytes

.;{({([(pentagrams are cool)])})};. Sivintilituscimt Spunsimtsbuncyndt

output:

s

no quotation marks? What sorcery is this???

Answer 26

C, 51 (cracked)

Code

f;main(h,taxgpl) {for(c=90;c;c++) printf("%.d",h);}

Output

8065

Original Solution

main(h,dr){float c=+h+0xf.cp9;;; printf("%g",(c));}

Answer 27

C++, 192 chars (Cracked)

Code

#include<stdio.h>
#define d double
(){return ;}(){return ;}int main(){printf("%.15f",));}       %(((((()))))****,,,,,,,,,,,-----..///000011122234477777::>??dddddfffggggiiiiiiiiiiinnttxxxxxxyyy

Output

3.141592653589793

Answer 28

QBasic, 42 bytes (Cracked)

I am having way too much fun here.

Code:

FAIR
N=PATERN"QBasic!"TIME 2 OR 1+1
HOUT N

... including 2 newlines. (This is written in a new dialect of QBasic that allows you to use nonstandard English, redundancy, and misspelled keywords as long as you tell the compiler that it's all FAIR.)

Output:

QBasic!
QBasic!

... including a trailing newline.

Answer 29

JavaScript, 46 characters [Cracked]

This one is easy, so I expect it to be cracked quickly.

Code

//terser code..
alert(the union fears dwarves)

(includes newline)

Output

ordered

Answer 30

JavaScript, 28 Cracked by Martin Büttner

Since my other submission was cracked, here's another.

Code

eval(atob('[every thing]'));

Output

1

Run in browser console (result is REPL), tested in Chrome 38 and Firefox 33