Search Results

><> (Fish), 1 byte 0 Try it here! 0 can actually be substituted for any hexadecimal number 1-f. Explanation 0 in ><> simply makes a 1x1 codebox for the fish to swim in. It constantly adds a 0 on …

NASM, 3 bytes ret I guess it tries to jump to whatever is on the default stack and immediately segfaults :). Built with: nasm -f elf64 golf.asm && ld golf.o -o golf

*><> (Starfish), 22 bytes " ::"s@hm@donononooo Try it here! Ungolfed >s":"m":"hnonon" "ooo1S\ \ ;?+1iod/ Explanation d push \r to the stack " ::" …

><>, 14 bytes 0:o1+:r:@=?;$! Try it here! Explanation 0 push 0 to the stack [n, 0] : duplicate the top value [n, 0, 0] o output it …

><>, 3 bytes !]! Try it here! Explanation ! skip next instruction ] close stack (crash) ! skip next instruction (jumping to close stack)

Display a Digital Clock (I see there are many clock challenges, I have tried to read them all, I'm pretty sure this is unique) Write some code that continuously updates a digital clock displayed in …

Python 3 (164 194 186 181 168 165 bytes) p=0 w,*x=input().split() for i in x: if '-'>i:w,p=w[:p]+i[1:]+w[p:],0 else: try:p=w.index(i[1:],p) except:p=len(w) w=w[:p]+w[p:].replace(i[1:],'',1) p …

><> (Fish), 16 bytes Solution 1 01+:{:?!;1-rnao! Try it here! Solution 2 01+::{:{(?;rnao! Solution 3 0\ o>1+::{:{(?;rna Wow can't believe I don't see any ><> submissions, have 3! All the so …

*><>, 20 18 bytes a1Fi:0(?b1-:?:1Fn; This actually works on Linux (and whatever supports files named \n I guess). It creates a file named \n on first run and outputs 10. It proceeds to output one l …

><>, 47 bytes <v[1:$-1;!?:$+10 0\:& $>:@=?v1+&:&"*"o 0f]oa~<. Try it here! This was fun to write, though a bit more bytes than I expected.

SmileBASIC, 69 68 bytes LOAD"PRG1:"+PRGNAME$(0),FALSE PRGEDIT 1 FOR I=0 TO 3?PRGGET$(); NEXT Load the program into slot 0 (the default slot), and run! Explanation LOAD"PRG1:"+PRGNAME$(0),FALSE l …

Some of your employees have broken capslock keys and you're too cheap to replace them. Help them out by creating the shortest program possible to correct their work! Simply convert each character in a …

><> (Fish) 52 63 62 bytes <v!?:-1:!?-1%2: >~la}}" "72. v!?-2lno<o" " o >:?!;"\ /"ooo1- Try it online! To use simply place n on the stack and away you go! Much of this is taken from @Teal-Pelica …

><>, 7 15 bytes l1+2,[v ;!?lo< Try it here! This is a full program. To use it simply place the palindrome on the stack, and the result will be outputted to stdout! Explanation l get the s …

><>, 40 bytes _5l)?vl1-[&r02. } .32< x{|$! /r]& >l?!;o Try it here!