« first day (1723 days earlier)      last day (3123 days later) » 
00:00 - 15:0015:00 - 00:00

3:00 PM
@Mego The one which mine was a duplicate of (and which has been suggested for yours too) is a popularity contest, which is frustrating if you've come up with an objective scoring method. However, at present I agree with Calvin's Hobbies second comment in the sandbox, so the scoring method isn't right yet
 
Anonymous
Rule #3 in my post disallows cat-like programs
 
@Mego Yeah I missed that, but where is the line drawn between interesting and uninteresting?
 
@Mego I think that still just shifts the problem one place along. I can now make the minimum required attempt to golf, and enter that very short program
 
Exactly
 
Ideally a scoring method should reward how well the code golfs a variety of different inputs, but that is very hard to judge without making it language specific
This is why the other one is still a popularity contest - we did try hard to think of a good winning criterion a year or so ago
 
3:03 PM
@trichoplax e.g. Could one just replace \r\n with ; in javascript?
 
@Calvin'sHobbies I know there are a number of easy improvements to be made in python, and only one of them would be required to count as "not cat". In any language, the improvement doesn't have to be possible for a given input - that can never always be true anyway
 
Anonymous
Perhaps making the score the difference in bytes between your program and its output, when given itself as input? Except that would lead to just artifically inflating answers with whitespace/NOPs...
 
So just converting double spaces to single spaces would count, even though most code will be unchanged by it
@Mego Yes exactly - ideally it needs to be set test cases, but that can only work for a single language.
It is a very tough criterion to get right
 
Anonymous
How about the score is the sum of the difference in bytes for a few select inputs? Such as itself, a Hello World program, and a 99 Bottles program? Ideally the Hello World and 99 Bottles original programs would be chosen from a neutral source, like RosettaCode or esolangs
 
People will still game that
One option is to define your own language and examples that are golfed. (with golfers still in any usual language)
 
Anonymous
3:08 PM
Maybe, but in the end, no matter how the challenge is stated, there will always be a way to game it.
 
For a single language it can work:
11
Q: Auto-meta-code-golf

Nathan MerrillYou are sick of all of the codegolf challenges. Hence you decide to write a program that will automatically golf some Python code for you. There are 3 test cases: print quickSort([0,7,3,-1,8,10,57,2]) def quickSort(arr): less = [] pivotList = [] more = [] if len(arr) <= 1: ...

 
Anonymous
I wanted to make it as generic as possible, to allow as many languages as possible to compete. It'd be interesting to see what a CJam solution would look like.
 
I love the idea of a language agnostic version, so everyone can compete regardless of their chosen language, but the only way I can see it working is to have test cases for every language that someone wants to compete in...
 
Anonymous
I wouldn't mind putting in the legwork to create a test case for every language people submit answers for
 
Anonymous
Like I suggested before, the test cases would probably be the golfer itself, Hello World, and 99 Bottles
 
3:14 PM
Could they optimize their answer after seeing the test cases?
 
You could suggest that in your sandbox post and see what people think. You could invite comments on your final posted question requesting new language test cases.
 
@Mego Fixed the last test case. One last clarification: The questions will always be Is <Class> a <Class>? or Does <Class> have a <member>?, yes?
 
@Calvin'sHobbies Have you seen the third answer for the python golfing question...?
 
Anonymous
@Calvin'sHobbies I would prefer generic optimization that will perform better across all inputs, rather than optimizing simply to perform better on the test cases. But I don't see a reasonable way to do that, so there wouldn't be a restriction.
 
Anonymous
@Dennis Correct, those are the only two formats. You may safely assume that no incorrectly-formatted input will be given.
 
3:19 PM
Great, thanks! I think I can start working on that explanation now.
 
Anonymous
Always glad to help
 
@Mego @Calvin'sHobbies if only the input is being golfed (not the answer itself) then hopefully tailoring to the test cases won't be too much of a problem - we just need test cases that cover most of the methods of golfing
 
Anonymous
Now how do I make a chat transcript?
 
I'd think you'd need many more test cases than just Hello World and 99 bottles to get an accurate result.
 
@Mego The drop down arrow to the left
 
3:20 PM
or scroll to the top and hit "full transcript"
 
Anonymous
Alright, updated the scoring rules. How does it look now?
 
Esoland?
:P
 
Anonymous
You saw nothing
 
I wanna go!
 
Anonymous
All rides are Turing tarpits
 
Anonymous
3:32 PM
Brainfuck is much more literal than you'd be comfortable with
 
I think including the code as one of the test cases still leaves the loophole
 
Yeah
If they just golf it anyway the difference will be 0
 
If you take that bit out, I'd see it as viable but controversial, and that's not a bad thing...
The only question I have is, what is the tie breaker between two programs in the same language that score the same?
Making it shortest code leads back to the same problems.
Simply first posted might work
 
Anonymous
Since the self-input score is only part of the total score now, and it's the difference in lengths, any gaming of the system will have minimal effect
 
Anonymous
I don't know about first posted, since I'm not disallowing optimizing via edits
 
3:35 PM
If I make my code N bytes longer, and all N of them are removed, I score N more, right?
 
@Mego You'll have to deal with people answering in Hexagony and other crazy languages that probably have no 99 bottles implementations. Which means that you'll have to learn them, write the code, and decide what the ungolfed and golfed versions are.
 
@Mego Yes I should clarify that more. First to post that score, rather than basing on the initial answer time
 
Anonymous
@trichoplax True, that is a serious exploit still. Suggestions for a third neutral test case?
 
Anonymous
@Calvin'sHobbies When I said "collaboration with the community", I meant "write Hexagony code for me" :P
 
But that's not fair
They will write the code to suit their own golfer then
 
3:37 PM
@Calvin'sHobbies That's a good point. Particularly as more test cases is better, but makes that problem even worse
 
You have to ok it to make it impartial
 
It's OK for languages which dozens of people use, but a language that only one person here uses means they can hand pick their own test cases (unless you learn it too - as Calvin's Hobbies points out)
 
Anonymous
Yeah, I'll be the final judge on whether a test case is acceptable or not. I expect that people will mostly play fair when it comes to helping me create test cases for languages I'm not familiar with, for the sake of the contest
 
Anonymous
This is also a good excuse for me to learn the fundamentals of some new languages
 
Anonymous
Err, in the spirit of the contest*
 
3:40 PM
@Mego I would not count on that. In my experience people usually are fair here, but they are also very vocal about making sure that no one else can be unfair.
 
Anonymous
@Calvin'sHobbies Hence why I am the final arbiter.
 
There are still likely to be people complaining that the test cases are not consistent between languages, and you will be making a lot of work for yourself, but this seems a lot closer to making it to main than before
 
Anonymous
There isn't a way to make it perfectly fair. The closest we can get is having a neutral party (i.e. me) make the call. I'm willing to put in the work, because this is an interesting question to me, and I'm eager to see what people come up with.
 
@Mego But people won't like that either. Your ability to recognize golfability in languages you may have just learned is not an objective winning criterion.
 
Anonymous
True, but I don't currently see a way of making the challenge more fair.
 
3:52 PM
One way is to restrict it to "common" languages that definitely have solutions elsewhere online.
But otherwise I'm just warning you that it's possible your question would be closed
 
Anonymous
Maybe restrict it to languages that have Hello World and 99 Bottles example code on Rosetta Code or Esolang?
 
@Mego If I print 1s and 0s, does the output have to be one per line or can I just print them without separation? (It wouldn't save me any bytes, but it would make the truthy values consistent.)
 
Anonymous
@Dennis You should separate them in some way, whether it be spaces, newlines, or kittens. Outputing "110" is ambiguous - is that "1,1,0" (true, true, false) or "110" (true)?
 
OK, I'll leave it as it is.
 
4:13 PM
@Dennis :(
 
0
Q: Can I invent a language to solve a problem that's in the Sandbox?

Calvin's HobbiesWe have rules about answering challenges with a language that was invented after the challenge was posted. Can I invent a language to easily solve a challenge that's currently in the Sandbox and then answer with that language once the challenge has been posted? I doubt this has happened for a w...

 
I've made some progress on my bitcoin challenge controller.
One thing I want to figure out, however, is how to scrape the bots from their answers.
To the very far right of this graph is a little line representing a random bot.
It outputs a random number each turn, losing money due to the 0.2% trading fee.
 
Anonymous
4:31 PM
codegolf.stackexchange.com/a/61124/45941 This answer is driving me nuts
 
Anonymous
I know it's undoable, but dealing with Java reflection is like herding hyperactive kittens
 
@Mego It is done.
3
A: Golf Me An OOP!

DennisCJam, 59 bytes q_'.e=\N/{)'?=\S/>_,(%}%/(__,*{(2$z~@f=.*\m*|}/ff{1$e=>:=N} This finishes instantly for both test cases. It either prints the second name name of the question or 1 (both truthy), or 0 (falsy). Try it online in the CJam interpreter: Chrome | Firefox Idea Because of the distin...

 
0
A: Sandbox for Proposed Challenges

Pyrrhacode-golf Objective Given a string in Markdown, determine how much of the string is in bold and italic. Test Cases **Bold** --> 0 *Italic* --> 0 **_BI_** --> 2 __*abcde*__ --> 5 This is in **bold and _this_ is in italic** --> 4 \**_BI_** --> 0 \\**_BI_** --> 2 This is not in ___ bold-italic _...

 
Anonymous
@Dennis Very nice, now we just need more answers :P
 
Anonymous
5:10 PM
Ahah, got the Java one
 
5:40 PM
Hey, @Sp3000, [] don't have any value in ><>, right?
 
Recursion, kinda
 
Hmm... okay. It's not in the list in esolangs.
Wait, it is.
Just didn't see it at first, whoops.
 
Anonymous
@VTCAKAVSMoACE I have to ask... Does your name stand for anything?
 
Yes. :D They all relate to objects special to me (i.e. inherited items, familial references, one of them has to do with a game) in my life.
 
Anonymous
I'm guessing the C stands for cat :P
 
5:49 PM
Actually, no. It stands for coat. c:
 
Anonymous
Similarly fluffy, I hope
 
Sorta. Belonged to my great-grandfather, it's mounted on my wall. (Vintage Trench Coat)
 
Anonymous
Ahh, cool :P
 
Yeah - for the java question, I want him to implement this.
Simply because it's so terrible. XD
 
Anonymous
Trying to mess with the integer cache would probably mess up the other reflection tricks he was using
 
5:54 PM
Not if you did it last, I don't think.
Or in any order. He's not messing with anything particularly mathematical, no?
 
Anonymous
The getField(...) method involves iterating through the class's fields. Redefining 0, 1, and 2 would almost certainly break iteration. Also, if I'm not mistaken, messing with the integer cache would only affect integer literals - calling Test2.class.getMethods().length should still return 1.
 
Anonymous
And there's always the possibility of abusing the C/C++ API to grab a 1 from native code
 
Hmm. I don't play enough with the Integer cache to really give info on that. It might not return 1, because it's still returning an int, but then again, I haven't played with it very much/at all.
 
The cache wouldn't affect any ints. Only Integer objects.
 
6:20 PM
^
 
My rep is a very nice, even "1,111"! :D
 
Well it looks like Objective-C isn't going to actually work for my interpreter So I'm going to have to write this in shudder C#
I could also write it in OCaml but I do not believe it is on the top 50 of that list you have
@El'endiaStarman Cool!
 
Wait WHAT?!? The guy who makes Irregular Webcomic! created some of the esolangs that are in use on this site! Link, and how I found out.
 
Oh. My. God. All of those feel like references to Old Man Willakers. XD
 
Oy. Whenever sounds fun. (Not for me!)
 
Anonymous
6:36 PM
@El'endiaStarman I'll learn it... sometime...
 
What are the basic components that stack-based languages should hold? Popping items off the stack, reversing...
Like, not relevant to operations, just talking about stack manipulation.
 
@VTCAKAVSMoACE Popping, swapping, rotation and reversal.
 
@Dennis Wanna have a look at my cup-stacking CJam script and see if you can make it faster (yeah that, not shorter).
 
Game Dev chat says "Please star responsibly" in the room description. Lucky we don't need that here.
7
 
@quartata Thanks. c:
 
6:45 PM
I knew it!
 
Also something that I love about GS2 is that "nipping" the second most item on the stack is one instruction
GS2: nip
CJam: \;
 
Anonymous
Eww 3 bytes for an instruction, golf that more
 
It's one byte.
That was in mnemonics.
 
Anonymous
Oh, GS2 has special scoring?
 
Anonymous
Ahh
 
6:47 PM
No, it's bytecode.
 
In the general case, three in Minkolang: 1~g. Or if you don't mind putting the top of stack on the bottom, 1R.
 
the cup stacking spec is pretty much ready... I might add a few more test cases and such, but I think it can be reviewed now:
10
A: Sandbox for Proposed Challenges

Martin BüttnerStacking Cups Efficiently code-challenge I'm sure everyone has seen before that cups can be stacked into pyramids (and other shapes): A A A A A A A A A A A A A A A A A Yes, A is definitely an adequate character to represent a cup. New cups could be added eit...

 
When compiled it is just F
 
Anonymous
@MartinBüttner Looks good to me
 
6:50 PM
in GS2.
 
@MartinBüttner This needs an answer in this programming language.
 
@VTCAKAVSMoACE heh
 
Anonymous
It'd be great if there was documentation for it
 
Exactly my thought.
 
@MartinBüttner Gladly, but I can't do it right now. I'm heading out to a birthday party.
 
6:55 PM
@Dennis What kind of cake?
 
Anonymous
Make sure to take an optimal amount of cake
 
Not sure yet. I'll bring back pictures. :P
 
@Dennis you'll find it in the sandbox post when you have some time ;)
@VTCAKAVSMoACE To be honest, I had the idea for the challenge when trying to design an esolang where a stack of cups like this is the metaphor of the memory model
 
Anonymous
@MartinBüttner Pyragony
2
 
6:58 PM
@Mego Triangular Prismagony
 
@quartata Too long.
 
Anonymous
@MartinBüttner Pyr for pyramid
 
@VTCAKAVSMoACE Rats
 
@Mego oh...
head -> desk
 
You know, a 3D language would actually be pretty interesting.
 
Anonymous
7:00 PM
@quartata There's a Befunge variant in 3d
 
@Mego Befunge 98 is actually defined for any number of dimensions I think
(I should rather say Funge 98, because the "Be" indicates the 2d-ness)
 
I was just about to put up a link to a 4D language.
 
Anonymous
 
Anonymous
Trying to use the IDE for Trefunge is... interesting
 
@quartata Minkolang actually is 3D. It's just usually not terribly efficient to use that feature.
Efficient golfing-wise, that is.
 
7:12 PM
How about a 0D language.
7/9D?
 
@flawr ` `
 
@El'endiaStarman One key to the right=)
-2D
haha
iD
 
How about a true 1D language? Every instruction MUST be on one line.
 
TI-Basic is basically something like that.
 
@El'endiaStarman many esolangs ignore newlines
Pyth used to ignore everything after the first line
@flawr hmmm, could a language be defined on some fractal space? :)
 
7:16 PM
@MartinBüttner Ahh, interesting. I don't think I've seen much of them.
 
@El'endiaStarman well take brainfuck for instance... enforcing that the entire code is on a single line wouldn't really make a difference to the language
 
@VTCAKAVSMoACE The absolute basics are dupe, pop, and some mechanism to allow access to more than the top. I think if you're after a minimalist approach then dupe, pop, and one-parameter rotate.
 
Yeah - I was going to use dupe, pope, and reference to - the last being that the last item in the stack defines where to look in the stack.
And it will be 1D. c:
 
That's not really enough.
You need some way to bring values from below the top up to the top to pop them.
 
Oh, and reverse.
Did it really autocorrect to pope? o-o
 
7:23 PM
@MartinBüttner True.
 
@VTCAKAVSMoACE you're lucky that it didn't correct "dupe" to "dope"
 
Sorry. This is what I'll do: dupe, pop, reference to, reverse, rotate (both ways), and anything else I come up with along the way.
@MartinBüttner Very, very true.
 
@VTCAKAVSMoACE At least it was only auto-correct in a very small chatroom, not auto-translate which was then seen by millions of people.
2
 
Yup. That just became my wallpaper.
 
You must have a very low screen resolution.
 
7:26 PM
Mini-challenge: Can you write an n byte minimally golfed CJam program and an n byte minimally golfed Pyth program that do the same thing? The programs can do anything but must produce deterministic output dependent on some input. Try for n = 1, 2, 3, 4, or 5 (I'm not sure which is hardest...)
 
@MartinBüttner Only on my phone.
 
@Calvin'sHobbies That's brute-forceable.
 
@Calvin'sHobbies q vs w?
(both are the identity)
 
@MartinBüttner Sure. There's an n = 1 answer.
 
oh I see
well I don't know enough Pyth to go beyond one character :P
 
7:34 PM
Calling all @Sp3000's
 
All 3000 of them?
@PeterTaylor How would you determine whether a program is "minimally golfed"?
 
Or whether it works for all inputs? (without assuming some domain)
 
Really I'd use the brute force as a filter - the number of programs which pass it would be very small, and they could be manually checked.
 
7:50 PM
Is "1".equals(Integer.toString((int) (Math.random()*2))); a good way to randomize true/false in Java, or is there a better built-in?
 
@VTCAKAVSMoACE Random.nextBoolean
 
^
 
Without importing?
 
How about !(Math.random()%2)
 
@VTCAKAVSMoACE What have you got against importing?
@Calvin'sHobbies Lemme check in Beanshell to see if that works. It should though.
 
7:54 PM
@VTCAKAVSMoACE ... what's wrong with just 1==(int)(Math.random()*2)?
 
@quartata Meh. I generally don't like it, for whatever reason.
@Doorknob That's better than my solution, for sure.
 
Do you normally convert integers to strings to check if they're a certain number? O_o
 
@Calvin'sHobbies I'm pretty sure you can't use 1 and 0 to represent booleans, but I'll try it.
 
@Calvin'sHobbies Yeah this doesn't work der
 
No. I just had a brain fart.
 
7:55 PM
@Doorknob This is fine though.
 
I was thinking Math.random gave an integer
 
bsh.InterpreterError: bad double unaryOperation
at bsh.Primitive.doubleUnaryOperation(Unknown Source)
at bsh.Primitive.unaryOperation(Unknown Source)
at bsh.BSHUnaryExpression.unaryOperation(Unknown Source)
at bsh.BSHUnaryExpression.eval(Unknown Sourcebsh % )
at bsh.BSHArguments.getArguments(Unknown Source)
at bsh.BSHMethodInvocation.eval(Unknown Source)
at bsh.BSHPrimaryExpression.eval(Unknown Source)
at bsh.BSHPrimaryExpression.eval(Unknown Source)
at bsh.Interpreter.run(Unknown Source)
at java.lang.Thread.run(Thread.java:745)
 
It gives a double in the range [0,1).
Thanks Doorknob!
 
@VTCAKAVSMoACE Math.random() < 0.5 then. (or the better nextBool thing)
 
@Calvin'sHobbies Ooh, that's even better, actually. Shorter than nextBoolean, I believe.
If I made the interrobang character part of my code, could I define a specific byte convention for it? Considering I'll never use NUL?
 
8:03 PM
@VTCAKAVSMoACE Can you make up your own character encoding you mean? No. At least not once the challenge is posted.
 
No, no, for my programming language. c:
 
Oh, um sure I guess :P
 
Would it be accepted as a proper byte count is my question, to clarify. Sorry.
I would assume so, but... when in doubt...
 
In my opinion, it should reflect the number of bytes actually stored in memory.
 
@VTCAKAVSMoACE Like if you define a new encoding for your language so in future you can count the interrobang as one byte?
 
8:06 PM
@Calvin'sHobbies Precisely.
 
Basically what GS2 does.
 
I'm not sure we have an official policy on that but I don't see why not. Not much different from using NUL and replacing it. (related?)
 
Coolio, thanks. I really wanted to use ‽ as if not.
 
It's similar to how APL uses its own code page.
 
@quartata Took me a while to figure out why the public-side online interpreter wasn't working, but here's an example of the 3D-ness of Minkolang.
 
8:33 PM
@VTCAKAVSMoACE What would be the point? A character encoding which isn't supported by anyone's text editor is useless.
 
Yeah, I thought about it some more and came up with the same conclusion. :c Oh well.
 
Ugh programming in C# is terrible
Why are methods uppercase?
This hurts my Java brain
 
^ Yup. Just yup.
 
;_;
It's the only way this interpreter for feersum's challenge is going to work
And I know it'll be great when I'm done, but just... really?
I'm going to check again and see if OCaml isn't on that list...
 
TIL Matlab has block comments, after using it for more than 3 years.
 
8:38 PM
OCaml sucks but at least it sucks logically
(I'm probably insulting some C# fanatic in here, but still)
 
I don't use ArrayLists often... I assume that if you use list.remove(list.size()-1);, it makes list.size(); return one less, right? That makes sense, no?
I'm basically certain. xD
 
Good. Making sure I wasn't doing something idiotic.
2
 
@VTCAKAVSMoACE It does.
Not to advertise, but Beanshell is a really nice REPL for Java
Helps out when you want to try little things like this
Without writing a whole program.
 
JGrasp and Eclipse have similar things...?
 
8:47 PM
Oh, I didn't know that.
 
I can't find the one in Eclipse. :D Might mean it doesn't exist.
 
I use NetBeans which doesn't have that so it's convenient to me.
 
But JGrasp definitely has one.
 
A Java REPL sounds simple but it is actually really difficult.
You basically have to write your own parser and use reflection to figure out what each token is.
 
9:01 PM
^ some knot theory stuff I was messing around with.
 
I think the majority of answers to the "Make your language unusable" are invalid in some way of other, but I'm not sure that there's any point voting as "Unclear" when it already has so many answers, even if the answers are the real proof that it's unclear.
 
9:36 PM
0
Q: Create random Christmas ASCII art

DanielConsidering it's nearing Christmastime, I though I'd take this opportunity to make my first code challenge. Since this isn't a Code Golf, the most creative approach will be selected as winner. The Challenge: Write a program/script to generate random Christmas themed ASCII art without using sim...

 
@PeterTaylor If it helps, hopefully by the end of the day I can invalidate one of them :)
 
0
Q: Encrypt/Decrypt text input

DanielHere's a useful code golf for you. The Challenge: Write code that will take a text input, along with an encryption/decryption key, and encrypt or decrypt the text. Example: Input: cryptit -E thisisakey "Hi Bob, I saw Marge at the store today, and she asked me to tell you that they're complet...

 
Oh wait, there's an easier way :/
 
9:59 PM
Actually Peter, does your programming language definition count hardcoded input as input?
 
10:58 PM
Why is there a modulo for BigInteger but not BigDecimal? grumble
 
Anonymous
11:31 PM
@VTCAKAVSMoACE The guy finally added a SecurityManager, which is what I was waiting on. It's a lot harder to get around it now. Basically the only way you could undo it is by somehow redefining String.equals(String) so that it always returns false. But I dunno how to do that.
 
Why would changing .equals affect that? :D
I don't deal with SecurityManage ever, so I have no idea why that would affect the outcome.
 
Anonymous
In the SecurityManager, it checks what kind of action you're trying to take, and if it's one of the unallowed ones, it throws an exception. It does that check by comparing Strings. If String.equals(String) always returns false, everything goes.
 
Ooh. Cheaty, but effective.
 
Anonymous
Well, it's Java. You expect fair play?
 
Heh. The only problem is changing what String.equals(String) means.
Might be protected by the SecurityManager: Catch-22.
 
Anonymous
11:44 PM
I know :\ it'll probably require bytecode hacking
 
Anonymous
The SecurityManager was a strong fix. It's probably possible to still get around it, but it's hard. Really the only sure-fire way to make Java unusable is to unload all loaded classes and wipe them off your hard drive.
 
How to break Java: Remove it.
2
 
Anonymous
Except I'm not sure if you can actually unload java.lang.System - if not, then you could execute a series of shell commands to download the jre, extract the archive, and reload it.
 
Anonymous
Nuking from orbit is an effective strategy
 
Runtime.exec() is your friend. c:
 
Anonymous
11:50 PM
The fact that the JVM uses JIT compilation makes it susceptible to that strategy. If it preloaded every referenced class, you couldn't wipe the files, because they'd be locked by the JVM.
 
There's now 4 close votes...
 
Anonymous
Hmm... I wonder if it'd be possible to write a nested class inside of main, with its own main, and load that, overwriting the current stack
 
Anonymous
I liked the challenge, but I think it would've been much better as a CnR
 
I could cast the final vote right now, but I don't think I will.
 
Anonymous
Someone did, wasn't me
 
11:56 PM
D: I rather liked that question.
 
Does anyone have a suggestion for the task in this question? meta.codegolf.stackexchange.com/a/7211/30688
 
Anonymous
Me too, but it didn't work for code challenge. It really needed to be CnR.
 
I don't anticipate it getting reopened.
 
@Mego When the question was sandboxed, about 9 people voted against CnR...
 
My description says "create a programming language" but there aren't really many rules that would make submissions actually resemble a programming language
 
Anonymous
11:59 PM
@Sp3000 I'm aware, I voted for CnR.
 
In most CnR's there is supposed to be a known way to crack it.
 
00:00 - 15:0015:00 - 00:00

« first day (1723 days earlier)      last day (3123 days later) »