# Print your code backwards - reverse quine

Write a program that prints its own source code out backwards, in other words an eniuq.

Scoring:

• +50 if you use pull data from the Internet.
• +1 point per character
• Lowest score wins.

Rules:

• No using other files (e.g. reverse.txt)
• Minimum code length is two characters.
• Your program cannot be a palindrome.
• Looks like this has been done before, just without the "no palindromes" rule. – Iszi Dec 18 '13 at 18:59
• Are those scores bonuses or penalties? You need to specify in words if something is a penalty or a bonus, because saying +10 can be taken to mean either "score as if it had 10 more characters than it actually does" or "the code can have 10 more characters that won't be scored", or other interpretations. – AJMansfield Dec 18 '13 at 20:24
• @AJMansfield Lowest score wins means that +x would be a penalty, -x would be a bonus. – Iszi Dec 18 '13 at 20:32
• The one question I have, then, is why is pulling data from the internet given a larger penalty than reading the source file? – AJMansfield Dec 18 '13 at 20:35
• Woohoo, 1st place on the hot network questions list :D Our site needs more attention... – Doorknob Dec 19 '13 at 0:09

# Stax, 14 bytes

"r34b4l"r34b4l


Run and debug it

Yet another adaption of the "34bL"34bL quine.

# Befunge-93 (FBBI), 13 bytes

">:#,_98+2*,@


Try it online!

Relies on nonstandard interpreter behavior. Works pretty much the same as this answer, except it's reversed.

# Jelly, 2 bytes

1-


Try it online!

Short but boring.

1 gets ignored when - makes -1 the argument which gets printed.

# Jelly, 8 bytes

“ṚṾȮ”ȮṾṚ


Try it online!

(More) interesting but long.

“ṚṾȮ” is a string literal for ṚṾȮ. Ȯ prints the string and returns it. Ṿ unevals the string, yielding the string “ṚṾȮ” (with the quote characters “” as part of the string). Ṛ reverses this string and its result, ”ȮṾṚ“ implicitly gets printed.

# Gol><>, 6 bytes

sP#Hr"


This is just another way of doing a reverse quine, similar to Bubbler's answer

Try it online!

# JavaScript, 33 32 bytes

f=([c,...s]='f='+f)=>c?f(s)+c:''


Recursively reverses the string by first providing the quine as the default argument. This beats the syntax error version, which isn't even consistent between browsers.

# MS SQL Server 2017, 173 bytes

declare @ char=1
select
reverse(substring(left(@+replicate('+char(39),3),201),28,174))
declare @ char=1
select
reverse(substring(left(@+replicate('+char(39),3),201),28,174))


Output:

))471,82,)102,)3,)93(rahc+'(etacilper+@(tfel(gnirtsbus(esrever
tceles
1=rahc @ eralced
))471,82,)102,)3,)93(rahc+'(etacilper+@(tfel(gnirtsbus(esrever
tceles
1=rahc @ eralced


Try it on db<>fiddle!