Timeline for Print a string in as few distinct characters as possible
Current License: CC BY-SA 3.0
15 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Sep 20, 2013 at 12:03 | comment | added | Johannes Kuhn | @SohamChowdhury Use an unary solution. | |
| Apr 21, 2013 at 1:24 | comment | added | Soham Chowdhury | Yes, I think OP is right though. Whatever you write, a binary solution's gotta win. | |
| Apr 17, 2013 at 22:48 | comment | added | ashastral | Sorry, but I'm going to have to disqualify this for the same reason as why I disallowed Brainfuck and Whitespace. When the language in question is limited to a small number of characters (8 for Brainfuck, 3 for Whitespace, 2 for any binary representation), it has an obviously unfair advantage over other submissions. | |
| Apr 17, 2013 at 12:40 | comment | added | Fors | @dan1111, it was meant to be a stretch. :) But it would not be very difficult to write this directly, using nothing but Intel documentation. | |
| Apr 17, 2013 at 12:29 | comment | added | user7486 | @Fors, to me it is quite a stretch to call a direct representation of machine code "source code". And certainly it was not your source code, since you wrote it in another language, compiled it, and then extracted this representation from the binary. | |
| Apr 17, 2013 at 11:57 | comment | added | Fors | This could be seen as source code, as it only needs a single tool to become machine code. | |
| Apr 17, 2013 at 11:34 | comment | added | user7486 | -1 I'm with @PeterTaylor. The output of an assembler is not "source code", which is what the question asked for. | |
| Apr 17, 2013 at 10:56 | comment | added | Soham Chowdhury | This is as boss as it gets :D | |
| Apr 17, 2013 at 10:48 | comment | added | Fors | If you refuse to call home.paulschou.net/tools/xlate a "standard tool", then no. But it certainly existed when this challenge started. | |
| Apr 17, 2013 at 9:49 | comment | added | Peter Taylor | So there's no standard tool to convert this into an executable, and the same encoding could be applied equally to any of the other answers? | |
| Apr 17, 2013 at 9:28 | comment | added | Fors | And then converted to binary using base64 and home.paulschou.net/tools/xlate. | |
| Apr 17, 2013 at 9:27 | history | edited | Fors | CC BY-SA 3.0 | I made an error in the conversion, but now it is correct. |
| Apr 17, 2013 at 8:47 | comment | added | Fors | I've just used NASM with the binary flag, with hand coded ELF headers to keep the size down. | |
| Apr 17, 2013 at 8:35 | comment | added | Peter Taylor | What's the compiler for this text representation? | |
| Apr 17, 2013 at 7:26 | history | answered | Fors | CC BY-SA 3.0 |