Ahead, 3 bytes

[email protected]

S    Slurp entire input to stack
 W   Write entire stack
  @  End

Try it online!

posted 8 months ago

CC0

snail_‭

211 reputation 2 7 21 2

C (gcc), 34 bytes

f(char*s){*s&&f(s+1)^putchar(*s);}

Try it online!

Alternative:

C (gcc), 35 bytes

f(s){read(0,&s,1)&&f()^putchar(s);}

Try it online!

Alternative #2:

C (gcc), 36 bytes

f(s){write(read(0,&s,1)&&f(),&s,1);}

Try it online!

posted 8 months ago

CC BY-SA 4.0

8mo ago

Sisyphus‭

191 reputation 1 3 19 4

Brain-Flak, 12 bytes

{({}<>)<>}<>

Try it online!

# (Implicitly) Read characters from STDIN and place them all on the active stack

# While the top of the active stack is not null...
{
    # Push the following value on to the active stack
    (
        # Pop the current character off the active stack and add it to the value we're tracking
        {}
        
        # Toggle which stack is active
        <>
    # (push)
    )

    # Toggle back to the stack the input was on
    <>

# (endwhile)
}

# Toggle stacks back so that the secondary stack is active when the program ends
<>

# (Implicitly) Print all values on the active stack

posted 7 months ago

CC0

DJMcMayhem‭

201 reputation 0 6 20 4

C, 66 59 bytes

-7 bytes thanks to Lundin!

In-place string reversal

f(char*s){s[1]?f(s+1):0;for(char t=*s;s[1];*++s=t)*s=s[1];}

Try it online!

posted 8 months ago

CC BY-SA 4.0

8mo ago

Moshi‭

491 reputation 5 17 55 27

JavaScript, 25 24 bytes

-1 byte thanks to @Arnauld‭

f=([a,...b])=>a?f(b)+a:b

Try it online!

posted 8 months ago

CC0

~2mo ago

Hakerh400‭

801 reputation 3 29 80 46

Shakespeare Programming Language, 184 bytes

,.Ajax,.Puck,.Act I:.Scene I:.[Enter Ajax and Puck]Scene V:.Puck:Open mind!Be you worse zero?If soLet usScene L!Remember you!Let usScene V!Scene L:.Puck:Recall!Speak thy!Let usScene L!

Surprisingly short for SPL. Errors out with a runtime.

Adds input to the stack, then recalls it. Since SPL handles one character at a time, this automatically reverses the input. SPL also has a built-in function, where if there is no input, it will return -1, which allows us to see the end of input.

Try it online!

posted 8 months ago

CC BY 4.0

Corsaka‭

206 reputation 3 4 23 5

Japt, 1 byte

w

Uh... yeah. Probably similar solutions for many other golf langs.

Try it

posted 8 months ago

CC BY-SA 4.0

Quintec‭ ☖

1459 reputation 15 32 154 39

jq, 16 bytes, preferably -rR

./""|reverse|add

Annoyingly, jq has convenient things like implicit I/O, and annoying things like adding strings, but you can't reverse a string >:|.

./""&add are slightly shorter than the more obvious split("")&join(""). The division operator splits a string, and add adds all the elements of an array together, using string concatenation in this case.

posted 5 months ago

CC BY-SA 4.0

5mo ago

Wezl‭

301 reputation 1 7 30 6

Turing Machine.io, 363 bytes

0 0 0 0 -1 8 0
0 8 4 0 1 9 0
0 9 -1 0 0 1 0
0 1 0 0 1 9 0
1 1 1 0 1 9 0
2 1 2 0 1 9 0
3 1 0 0 -1 2 0
2 2 2 0 -1 3 0
0 3 0 0 -1 3 0
1 3 1 0 -1 3 0
2 3 2 0 1 4 0
0 4 0 0 -1 4 0
1 4 1 0 -1 4 0
2 4 2 0 1 5 0
0 5 0 1 1 5 0
1 5 1 1 1 5 0
2 5 2 2 -1 6 0
0 6 0 0 -1 6 0
1 6 0 0 -1 6 0
2 6 2 0 -1 7 0
4 6 4 0 0 7 1
0 7 0 0 -1 7 0
1 7 1 0 -1 7 0
2 7 2 0 1 5 0
4 7 4 0 1 5 0

This is probably very golf-able. I'll golf this down and add an explanation later.

posted about 2 months ago

CC BY-SA 4.0

22t‭

21 reputation 0 1 2 0

Python 3, 20 bytes

print(input()[::-1])

Try it online!

posted 4 months ago

CC BY-SA 4.0

Wasif‭

81 reputation 0 4 8 0

Laser, 9 bytes

c⌜ps
 \U#

My own language's showcase time! This is a 2D language with an instruction pointer initially pointing to the right. It takes implicit input as an array of characters.

Explanation:

c⌜p    repeat as long as the current stack (input) isn't empty:
   s   pop from the current stack and push onto the next stack (the instruction pointer then loops back around to the c)

 ⌜
 \U#   once the current stack is empty, switch direction, get bounced to the right on the second line, move up a stack, and output it

posted 8 months ago

CC BY-SA 4.0

Quintec‭ ☖

1459 reputation 15 32 154 39

C (gcc), 62 bytes

main(){char b[99],*p=strchr(gets(b),0);for(;p-->b;)putch(*p);}

This relies on the usual gcc extension abuse. It assumes that max user input is 98 characters + null term, since this wasn't specified.

posted 8 months ago

CC BY-SA 4.0

8mo ago

Lundin‭

332 reputation 6 14 34 23

Ruby, 14 bytes

->s{s.reverse}

Try it online!

a straightforward builtin.

posted 8 months ago

CC BY-SA 4.0

Razetime‭

1424 reputation 24 37 145 52

PowerShell, 43 bytes

param($s)(($s=$s|% t*y)|%{$s[--$q]})-join''

Try it online!

posted 4 months ago

CC BY-SA 4.0

Wasif‭

81 reputation 0 4 8 0

Bash, 3 bytes

rev

Try it online!

Less boring:

Bash, 8 bytes

tac -rs.

Try it online!

posted 8 months ago

CC BY-SA 4.0

Sisyphus‭

191 reputation 1 3 19 4

Scala, 9 bytes

_.reverse

Try it in Scastie!

Explanation:

_.reverse
_          //The function argument
 .         //Call a method
  reverse  //Reverse the string

posted 5 months ago

CC BY-SA 4.0

user‭

676 reputation 3 32 68 44

Perl 5 -p, 10 bytes

$_=reverse

posted 8 months ago

CC BY-SA 4.0

msh210‭

51 reputation 0 3 5 1

Befunge-98, 45 39 37 33 29 21 bytes

v:~<
>a-|
>v$<
,:
^[email protected]

Try it online!

This answer probably sucks :P

posted 8 months ago

CC0

8mo ago

moony‭

472 reputation 10 6 53 43