# Golf you a quine for great good!

Using your language of choice, golf a quine.

A quine is a non-empty computer program which takes no input and produces a copy of its own source code as its only output.

No cheating -- that means that you can't just read the source file and print it. Also, in many languages, an empty file is also a quine: that isn't considered a legit quine either.

No error quines -- there is already a separate challenge for error quines.

Points for:

• Smallest code (in bytes)
• Most obfuscated/obscure solution
• Using esoteric/obscure languages
• Successfully using languages that are difficult to golf in

The following Stack Snippet can be used to get a quick view of the current score in each language, and thus to know which languages have existing answers and what sort of target you have to beat:

var QUESTION_ID=69;
var OVERRIDE_USER=98;

getAnswers();var SCORE_REG=(function(){var headerTag=String.raw h\d
var score=String.raw \-?\d+\.?\d*
var normalText=String.raw [^\n<>]*
var strikethrough=String.raw <s>${normalText}</s>|<strike>${normalText}</strike>|<del>${normalText}</del> var noDigitText=String.raw [^\n\d<>]* var htmlTag=String.raw <[^\n<>]+> return new RegExp(String.raw <${headerTag}>+String.raw \s*([^\n,]*[^\s,]),.*?+String.raw (${score})+String.raw (?=+String.raw ${noDigitText}+String.raw (?:(?:${strikethrough}|${htmlTag})${noDigitText})*+String.raw </${headerTag}>+String.raw ))})();var OVERRIDE_REG=/^Override\s*header:\s*/i;function getAuthorName(a){return a.owner.display_name}
body='<h1>'+c.body.replace(OVERRIDE_REG,'')+'</h1>'});var match=body.match(SCORE_REG);if(match)
if(languages.hasOwnProperty(lang))
langs.push(languages[lang]);langs.sort(function(a,b){if(a.uniq>b.uniq)return 1;if(a.uniq<b.uniq)return-1;return 0});for(var i=0;i<langs.length;++i)
{var language=jQuery("#language-template").html();var lang=langs[i];language=language.replace("{{LANGUAGE}}",lang.lang).replace("{{NAME}}",lang.user).replace("{{SIZE}}",lang.size).replace("{{LINK}}",lang.link);language=jQuery(language);jQuery("#languages").append(language)}}
body{text-align:left!important}#answer-list{padding:10px;float:left}#language-list{padding:10px;float:left}table thead{font-weight:700}table td{padding:5px}
 <script src="https://ajax.googleapis.com/ajax/libs/jquery/2.1.1/jquery.min.js"></script> <link rel="stylesheet" type="text/css" href="https://cdn.sstatic.net/Sites/codegolf/primary.css?v=f52df912b654"> <div id="language-list"> <h2>Winners by Language</h2> <table class="language-list"> <thead> <tr><td>Language</td><td>User</td><td>Score</td></tr></thead> <tbody id="languages"> </tbody> </table> </div><div id="answer-list"> <h2>Leaderboard</h2> <table class="answer-list"> <thead> <tr><td></td><td>Author</td><td>Language</td><td>Size</td></tr></thead> <tbody id="answers"> </tbody> </table> </div><table style="display: none"> <tbody id="answer-template"> <tr><td>{{PLACE}}</td><td>{{NAME}}</td><td>{{LANGUAGE}}</td><td><a href="{{LINK}}">{{SIZE}}</a></td></tr></tbody> </table> <table style="display: none"> <tbody id="language-template"> <tr><td>{{LANGUAGE}}</td><td>{{NAME}}</td><td><a href="{{LINK}}">{{SIZE}}</a></td></tr></tbody> </table> 

• Do you not mean, "Golf you a quine for greater good!"? – Mateen Ulhaq May 3 '11 at 2:49
• @muntoo it's a play on "Learn you a Haskell for Great Good". – Rafe Kettler May 3 '11 at 2:52
• Did anybody notice that this is question 69? – aidan0626 Oct 24 '20 at 22:47

## Perl 6, 36

printf |(q<printf |(q<%s>xx 2)>xx 2)


Based on the Perl 5 quine.

# Brachylog v2, 12 bytes

"~k;?w₁";?w₁


Try it online!

Full program. Essentially a translation of Fatalize's (non-builtin) Brachylog v1 answer, although it also uses different SWI-Prolog formatting sequences, or rather, a single different one, which saves about 20 bytes (both [34:s, both :34]s, and both ~cs). It seems to have existed back in 2016, but it was probably bugged or something. The last two bytes saved come from using the implicit input, which Brachylog being Brachylog is useful even when the program receives no input, because it's a variable (so instead of explicitly unifying the string with S, we just let it be implicitly unified with ?).

          w     Print
"~k;?w₁"        "~k;?w₁"
which is the input
₁    formatted with
;?      the input.
~k             (so that the ~k is replaced with the input's canonical representation, i.e. in quotes)


We don't actually need to use implicit input--"~kgjw₁"gjw₁ works just as well (and might even translate back to v1)--but doing so regardless manages to both more closely mirror the structure of the original and feel cleverer.

# C (gcc), 85 bytes

#define q(k)main(){puts(#k"\nq("#k")");}
q(#define q(k)main(){puts(#k"\nq("#k")");})



Try it online!

The q() macro expands into a program that prints out its argument on the first line, and prints out the argument called by q() itself in the second line. So:

#define q(k)main(){puts(#k"\nq("#k")");}
q(foo)


would expand into:

main(){puts("foo""\nq(""foo"")");}


and after string literal concatenation, becomes:

main(){puts("foo\nq(foo)");}


And executing and running the program would produce:

foo
q(foo)


Replacing foo with the macro definition itself results in the quine.

## C, 353 bytes

char q[]={125,59,109,97,105,110,40,41,123,112,114,105,110,116,102,40,34,99,104,97,114,32,113,91,93,61,123,34,41,59,99,104,97,114,42,112,61,113,59,119,104,105,108,101,40,42,112,41,112,114,105,110,116,102,40,34,37,100,44,34,44,42,112,43,43,41,59,112,117,116,115,40,113,41,59,125,};main(){printf("char q[]={");char*p=q;while(*p)printf("%d,",*p++);puts(q);}

• With some golfing, including changing it from hexadecimal to decimal, this can be 354 bytes – Jo King Aug 2 '19 at 2:04
• The link itself is a gcc compiler and it works fine. Are you sure they aren't just warnings? – Jo King Aug 2 '19 at 2:51
• If only the output is erroring, then what is the difference between the two programs? What version of gcc are you using? – Jo King Aug 2 '19 at 3:15
• ... What is the difference between the code of the two programs, not their behaviour. I already know that the second one fails. The version TIO uses is 8.3, and that works fine. – Jo King Aug 2 '19 at 3:32
• I don't care about the output of the second generation quine. I would like to know the output of the first program, the one that didn't fail and produced something that did. I don't want to know about the errors that you have commented about several times already. I would like to know the difference between the program I have given you and its output. You can put the program in an online compiler like I have and link it in a comment below. – Jo King Aug 2 '19 at 3:49

# Javascript (REPL), 2322 21 bytes

someone else posted this first

(_=x=>(_=${_})())()  paste into chrome console or equivalent to test # JavaScript (V8), 4948 47 bytes @NieDzejkob saved 1 byte on both versions console.log((_=x=>console.log((_=${_})()))())


Try it online!

# Wren, 287 bytes

var a="[118,97,114,32,97,61,34].each{|m|System.write(String.fromCodePoint(m))}
System.write(a+String.fromCodePoint(34)+String.fromCodePoint(10)+a)"
[118,97,114,32,97,61,34].each{|m|System.write(String.fromCodePoint(m))}
System.write(a+String.fromCodePoint(34)+String.fromCodePoint(10)+a)


Try it online!

## Explanation

var a=                                                                         // Define the variable a
"[118,97,114,32,97,61,34].each{|m|System.write(String.fromCodePoint(m))}
System.write(a+String.fromCodePoint(34)+String.fromCodePoint(10)+a)"           // As the string that processes the variable

// A literal newline is inserted and can be decoded literally.

[118,97,114,32,97,61,34].each{|m|System.write(String.fromCodePoint(m))}        // Output the string "var a=" to the console
System.write(                                                                  // Output without a newline:
a                                                                 // The string a
+String.fromCodePoint(34)                                        // Plus a quote
+String.fromCodePoint(10)               // Plus a newline
+a)            // Plus the string again
$$$$

• Why doesn't fromByte work in place of fromCodePoint? – Jo King Oct 29 '19 at 23:28
• I have absolutely no idea. – user85052 Oct 30 '19 at 3:57

# Symbolic Raku, 36 bytes

$_={$_~"<$_>)"}(<$_={$_~"<$_>)"}(>)



Try it online!

### Explanation:

$_= # Set the output to { }( ) # The result of the code block < > # With this string:$_={$_~"<$_>)"}(        # The first half of the program
$_~ # Concatenate this string with "<$_>)"                        # The quoted string, and the extra bracket


# Keg, 86 4 bytes

④④


Try it online!

### 8 bytes

:.,:.,


Try it online!

Why did it take me so long to figure out how to write a quine in Keg? I really should have picked up on this sooner.

Basically, it pushes the string :.,, duplicates it, prints the string repr'd and then prints it nicely.

## W, 13 bytes

Print the data string & prepend quote.

p34CS+"p34CS+


## tq, 8 bytes

New high-level language! (Technically inspired by Jo King's Symbolic Raku quine.)

etq'etq'


## Explanation

   'etq' # Define the second item of the list
# As a string
q      # Surround the string with quotes
t       # For the first item of the list,
# Access the last (tail) item in the list,
e        # and un-quote the accessed value.

# The list becomes etq, 'etq' (comma is for readability)
# , which then becomes foreach-printed without any separator.
$$$$


# Common Lisp, 58 bytes

Lisp is perfect for quines because of using code as data, but terseness is not its strong suit.

(FORMAT T "(~{~S ~}~:*'~S)" '(FORMAT T "(~{~S ~}~:*'~S)"))


Excellent expert explanation.

(FORMAT T  -- print
"(      )" -- between parentheses
" ~{  }~ " -- looping over the list argument
" ~S_    " -- each item followed by a space
"   ~:*  " -- use the FORMAT sublanguage's *very* fancy
-- "~*" directive (skip argument) with the ":"
-- modifier to back up and reuse the argument
"    '~S " -- print the argument again with a quote before it
'(FO.. -- the argument is the same thing but with a quote
-- in front to show that it is data


Ideone it!

## Alternative 9 bytes, that only works in the REPL

(prin1 -)


(use print for a trailing newline)

This prints the value of '-', which is the current expression being evaluated. You can try it here.

# Perl 5 + -p, 35 bytes

A fishy quine!

}{s<><}{s<><@>;s<@><lc>e>;s<@><lc>e


Try it online!

• I can somewhat get the other quines, but somehow Perl always manages to elude me. – Razetime Sep 17 '20 at 5:42
• @Razetime This particular one is a little tricky because it breaks out of the (implicit) while(<>){...} from -p first and then uses nesting chars for s/// (s<><> in this quine) and uses @ as a positional argument (like %s in the printfstyle quines). The final piece is using lc for a reference to $_ as everything would be unchanged by lowercasing. If I get time today I'll annotate this one properly too! – Dom Hastings Sep 17 '20 at 6:04 # Perl 5, 21 bytes say<<""x2 say<<""x2  Try it online! # *><>, 14 bytes "#ooooooo;!-1:  Try it online! *><> doesn't offer much more than its parent language ><> apart from file input and some new movement commands, neither of which are useful here. In fact, this is longer than the ><> quine, since *><> outputs the error to STDOUT, meaning we can't exit with an error. ### Explanation: " Wrapping string, pushing the code to the stack # Mirror, reverse directions " Pushing the code to the stack in reverse -1: Duplicate the top of the stack (#) and subtract one to get " ;! Skip over the terminate ooooooo Print seven characters # Mirror ooooooo Print the other seven characters ; And terminate  # 33, 24 bytes "34cke12ketp"34cke12ketp  Try it online! ### Explanation: "34cke12ketp" Push the string 34c0ke13ketp to the source string 34c Put 34 in the accumulator k Push a " to the destination string e Append the source string to the destination string 12k Push a " to the end of the destination string e Append the source string to the destination string t Swap the source and the destination string p And print the source string  # 4, 3101 bytes 3.611102101111601492000010000000160111200001000000016010020000100000001601002000010000000160139200001000000016019520000100000001601842000010000000160199200001000000016019920000100000001601092000010000000160190200001000000016010920000100000001601912000010000000160111200001000000016019920000100000001601992000010000000160121200001000000016011020000100000001601092000010000000160193200001000000016010020000100000001601892000010000000160101200001000000016011020000100000001601102000010000000160130200001000000016013020000100000001601002000010000000160100200001000000016019920000100000001601002000010000000160100200001000000016010920000100000001601202000010000000160100200001000000016010220000100000001601312000010000000160199200001000000016019920000100000001601282000010000000160199200001000000016019920000100000001601902000010000000160111200001000000016019920000100000001601992000010000000160127200001000000016019920000100000001601992000010000000160191200001000000016011120000100000001601892000010000000160179200001000000016012120000100000001601192000010000000160198200001000000016019320000100000001601992000010000000160110200001000000016019920000100000001601102000010000000160119200001000000016019920000100000001601922000010000000160101200001000000016011020000100000001601992000010000000160131200001000000016010820000100000001601042000010000000160100200001000000016011020000100000001601092000010000000160190200001000000016013020000100000001601302000010000000160160200001000000016019920000100000001601602000010000000160110200001000000016013020000100000001601302000010000000160151200001000000016010320000100000001601032000010000000160105200001000000016011020000100000001601302000010000000160130200001000000016010220000100000001601822000010000000160103200001000000016010120000100000001601182000010000000160129200001000000016012220000100000001601312000010000000160152200001000000016018220000100000001601252000010000000160110200001000000016012520000100000001601222000010000000160151200001000000016015120000100000001601022000010000000160120200001000000016011320000100000001601152000010000000160112200001000000016011120000100000001601012000010000000160131200001000000016012920000100000001601452000010000000160194200001000000016015920000100000001601452000010000000160194200001000000016015820000100000001601452000010000000160194200001000000016015020000100000001601552000010000000160184200001000000016015920000100000001601452000010000000160194200001000000016015920000100000001601452000010000000160145200001000000016015120000100000001601052000010000000160115200001000000016015420000100000001601542000010000000160156200001000000016011520000100000001601152000010000000160160200001000000016015020000100000001601562000010000000160194200001000000016019420000100000001601682000010000000160148200001000000016014620000100000001648486494965050651516545455150155454954954954855054954854954954954921310112151310220151522520152282513229281103028200303015030301503030106990603030990010040801399011029999101990199398991129798111999997299991109999982999913200002900000990000030301011098003990011299991119900990999948599300001194  Try it online! ### Explanation 3. Required boilerplate 6 11 10 Set cell 11 to 10 2 10 11 11 Set cell 10 to cell 11*cell 11 (10*10=100) -- Data Section -- Every pair of digits in the program are represented by 6 01 49 Set cell 01 to the two digits joined together 2 00 00 10 Multiply cell 00 by 100 0 00 00 01 Add cell 01 to 00 This essentially makes cell 00 the rest of the program after the data section 6 48 48 Set each of the cells 48,49,50,51,54 to their respective values 6 49 49 6 50 50 6 51 51 6 54 54 551501554549549549548550549548549549549549 Print the initial section ('3.611102101111') 2 13 10 11 Initialise various powers of 10 2 15 13 10 2 20 15 15 2 25 20 15 2 28 25 13 2 29 28 11 0 30 28 20 Create the number '1000000010000200106', which is each data part backwards 0 30 30 15 0 30 30 15 0 30 30 10 6 99 06 0 30 30 99 0 01 00 40 Copy cell 00 to cell 01 8 01 Loop while cell 01 is not zero 3 99 01 10 Integer divide cell 01 by 100 and store in cell 99 2 99 99 10 Multiply cell 99 by 100 1 99 01 99 Subtract cell 99 from cell 01 to get cell 01 modulo 100 3 98 99 11 2 97 98 11 1 99 99 97 2 99 99 11 0 99 99 98 Swap the two digits of the modulo result 2 99 99 13 Multiply it by 1000 2 00 00 29 Multiply cell 00 by 10**19 0 00 00 30 And append a copy of a data part 0 00 00 99 And insert the modulo result in the correct place 3 01 01 10 And divide cell 01 by 100 9 End loop Now we print the number in cell 00 in reverse 8 00 Loop while cell 00 is non-zero 3 99 00 11 Get the last digit of cell 00 2 99 99 11 1 99 00 99 0 99 99 48 Add the digit to '0' 5 99 And print 3 00 00 11 Divide cell 00 by 10 9 End loop  • I should write a SEDE query to see how many of the 362 quines you've written. – Razetime Sep 19 '20 at 17:00 • @Razetime A search for inquestion:69 user:76162 currently puts it at 32 – Jo King Sep 19 '20 at 21:44 • 8% of all the answers. I'm waiting for the day 50% comes. – Razetime Sep 20 '20 at 3:35 # pl – Perl One-Liner Magic Wand, 22 bytes Very late to the party, just for fun. This decades old Perl wrapper, was only released into the wild, when Corona went viral. There are 3 quines in the examples page. The one of interest here is the last, and of that the 2nd 1-letter alias variant. It's essentially the same as the Perl one, which it beats by 6 bytes. As on many examples on that page, hover the ▶ button, or the blue code box, to see the result. &f(qw(&f(qw(%s)x2))x2)  • Welcome to the site and nice first answer! The "default" online interpreter we use on this site, Try It Online!, has pl listed, so I've edited your answer slightly so it's closer to our standard format. Please, feel free to check out our main questions page for more challenges you can attempt! – caird coinheringaahing Oct 15 '20 at 21:00 • @caird-coinheringaahing Thanks, but that's a different pl. It implements some weird undocumented highly specialized language. It has nothing to do with Perl, other than being implemented in it. It's a total coincidence that it spews out my quine ;-) – Daniel Oct 15 '20 at 21:09 • Huh, a very weird coincidence. My mistake, I've rolled back my edit – caird coinheringaahing Oct 15 '20 at 21:10 • @caird-coinheringaahing Actually not such a weird coincidence. Apart from the few (code golf only?) tasks that other pl language is capable of performing, everything you throw at it seems to be a quine. Like calling cat a language. – Daniel Oct 16 '20 at 21:49 # TypeScript, 209 197 bytes type Q<X extends string[]=['','$',Q<['${X[0]}','${X[1]}','${X[2]}']>]>=type Q<X extends string[]=['${X[0]}','${X[1]}',Q<['${X[1]}{X[0]}','${X[1]}{X[1]}','${X[1]}{X[2]}']>]>=${X[0]}${X[2]}${X[0]}  Try it online! # Vyxal, 8 bytes :.,:.,  Exactly the same as my original Keg quine. ## Explained :.,  Push the string ":.," onto the stack  :.  Duplicate it and print the repr of it (vyxal repr) ,  Finally, print the string normally ## Ada, 274258 257 Characters with Text_IO;use Text_IO;procedure Q is M:Character:='"';T:String:="with Text_IO;use Text_IO;procedure Q is M:Character:=';T:String:=;begin Put_Line(T(1..54)&M&T(54..65)&M&T&M&T(66..126));end Q;";begin Put_Line(T(1..54)&M&T(54..65)&M&T&M&T(66..126));end Q;  pretty printed: with Text_IO; use Text_IO; procedure Quine is M : Character := '"'; T : String := "with Text_IO;use Text_IO;" & "procedure Q is M:Character:=';T:String:=;" & "begin Put_Line(T(1..54)&M&T(54..65)&M&T&M&T(66..126));end Q;"; begin Put_Line(T(1..54)&M&T(54..65)&M&T&M&T(66..126)); end Quine;  this program actually produces the short version (output can be redirected to q.adb). Pretty certain you can't get shorter than this with Common Lisp. The first one I managed to figure out myself; all credit to http://rosettacode.org/wiki/Quine#Common_Lisp for the second one. # Common Lisp - 9 (With REPL) (write -)  In Common Lisp, - is a special variable that holds the expression currently being evaluated but only during a read-eval-print loop. If you're running from a script or you've disabled the REPL though... # Common Lisp - 25 (No REPL) #1=(write '#1# :circle t)  This references itself and then prints itself out. :circle t makes it detect the infinite recursion cycle and exit early. # CJam, 1 byte Note: CJam was made after this challenge was posted, I am posting this answer as documentation as opposed to a serious entry. 0  Pushes a 0 to the stack, and CJam automatically outputs the stack after program execution. • Don't forget newlines. – CalculatorFeline May 28 '17 at 1:39 • One part of the program does not encode another, so this program is invalid – MilkyWay90 Feb 5 '19 at 18:04 # ForceLang with this module, 87 bytes Noncompeting, language postdates the challenge set j require njs j var f=function(){print("set j require njs\nj var f="+f+";f()")};f()  # Idris, 88 bytes q:String;main:IO();main=putStr$q++show q;q="q:String;main:IO();main=putStr$q++show q;q="  It’s like Haskell with more enforced top-level type signatures. I had to put q’s type first, because Idris’s type checker is a little weird? I dunno. # Forth (gforth), 21 bytes : x latest name-see ;  This prints the decompiled source of the latest word, thus only works if x is the latest defined word. Test: x : x latest name-see ; ok  This one works without that condition, but replaces the constant definition with it's value (since that's the only thing that actually gets saved to memory) : x [ latest ] literal name-see ;  Test: x : x 140121195205104 name-see ; ok  • If it prints with a newline in the middle, but the original doesn't have it, it's not a quine. – Pavel Dec 29 '16 at 5:07 • Fixed. It's because there's no way to tell where spaces/newlines are as it's only compiled code – 2xsaiko Dec 29 '16 at 13:39 • It's not a proper quine anyway, because it reads its own source. – mbomb007 May 10 '17 at 14:02 ## Pyke, 14 bytes "34.Cp\D\Es"DE  Try it here! "34.Cp\D\Es" - "34.Cp\D\Es" DE - eval(^, stack=^) 34.C - '"' p - print(^) \D\Es - sum("34.Cp\D\Es", ^, "D", "E")  # SimpleTemplate, 56 bytes This is a template engine language I've made for fun. It was written in PHP and run by compiling the weird syntax to PHP. This answer is a translation of Aurel Bílý's amazing PHP answer! {@setF"{@setF%c%s%c}{@printF,34,F,34}"}{@printF,34,F,34}  Weird, right? This works with the commit d1d3e2c43bd98da2bd38f884ee5ac7b39cb8c579 on my Github and you can try it on http://sandbox.onlinephpfunctions.com/code/cca9ed3b9c87abad61159725f159285e5daf9bb9. In there, you will have the existing code on that commit, plus showing the result and the generated PHP. # R, 47 bytes f=function(){cat('f=');print(f);cat('f()')} f()  Try it online! Can be extended to contain any set of operations by adding those before the first cat statement. Printing a function f returns the content of that function starting with function(){. I then added cat statements to handle the rest of the output. • should probably be 53 bytes, as print will add indentation and weird brackets placement. – Giuseppe Jan 25 '18 at 15:41 • @Giuseppe hmm, on TIO there also appears to be trailing spaces. If counting those we'd end up at 64 bytes – JAD Jan 25 '18 at 16:36 • :| too long – ASCII-only May 13 '18 at 10:37 • Alhough TIO adds spaces and newlines, my local install does not. The same thing occurs with my 44 byte answer. I haven't found which option is different between the two installs. Also, I accidentally downvoted your answer instead of upvoting it, and my vote is now locked. Sorry about that. If you edit your answer, I'll change my vote. – Robin Ryder Aug 4 '20 at 15:29 # GNU Make, 5251 11 bytes $(value $0)  When called as a function, returns its source code. And here's a complete makefile that doesn't return its code, but rather prints it: Q=$(info Q=$(value Q))$(info $$(call Q)) (call Q)  ## Explanation The second line just instantiates the variable, the first one defines it: (info Q=(value Q))(info$$(call Q))
$(value Q) # Get unexpanded value$$# "$" escaped
$(info Q= )$(info   (call Q))  # Print the remaining parts


# Babel, 161 bytes

{ "{ '{ ' << dup [val 0x22 0xffffff00 ] dup <- << << -> << ' ' << << ' }' << } !" { '{ ' << dup [val 0x22 0xffffff00 ] dup <- << << -> << ' ' << << '}' << } ! }%
`