New answers tagged

1 vote

Prime Challenge

Knight, 195 bytes Try It Online!
user avatar
  • 5,751
1 vote

Smallest subset of characters required for Turing Completeness

Probably-a-Cop: Go, 1 byte ( Functions can be anonymous in Go, but they must use a pair of parens to declare and call them. This prevents declaring ...
user avatar
  • 3,233
2 votes

Fewest (distinct) characters for Turing Completeness

Knight, 4 characters EA1+ Similar to many other answers here, the plan is to build a string representing Knight code using ASCII...
user avatar
  • 5,751
1 vote

Smallest subset of characters required for Turing Completeness

Sort-of-cop: Knight, 3 characters E=` Takes out EVAL, variable assignment, and ` (run shell ...
user avatar
  • 5,751
4 votes

Hello ASCII World!

Knight, 460 383 442 bytes, score 268 236 226 -32 score thanks to @Adam by utilizing A1 -10 score thanks to @emanresu A and @UnrelatedString by using ...
user avatar
  • 5,751
3 votes

Triangular code, triangular output

Knight, 26 bytes ; =a 0W> 6aO* '.'=a +1aQQQ Try It Online!
user avatar
  • 5,751
1 vote

1, 2, miss a few, 99, 100

Knight, 50 bytes O+++++++''-6 5', '-6 4', miss a few, 'A'c'', 'A'd' Try It Online! Probably not optimal but whatever.
user avatar
  • 5,751
0 votes

Print A-Z and their alphabet index without using 1,2,4,6

Knight, 38 bytes ;=a 0W>+*5 5TaO+++''=a++0Ta'. 'A+*8 8a Try It Online!
user avatar
  • 5,751
1 vote

Print 0 to 100 without 1-9 characters

><>, 11 bytes lnaol:aa*(% Try it online! Terminates by error.
user avatar
  • 45k
1 vote

Print 0 to 100 without 1-9 characters

Knight, 37 36 29 21 bytes -8 bytes thanks to @Razetime for reminding me about the ASCII function, which made my entire coercion thing useless ...
user avatar
  • 5,751
10 votes

Fewest (distinct) characters for Turing Completeness

Python 3, 8 characters Now we can write python in only 8 characters! Previous works have found that any python codes can be reduced into 9 characters. Such as: exc('%1+) and exchr(+1). Their core ...
user avatar
  • 101
0 votes

Palindromic palindrome generator

C (gcc), 100 bytes main(c){read(0,&c,1)&&putchar(c,main(write(1)));}//};)))1(etirw(niam,c(rahctup&&)1,c&,0(daer{)c(niam Try it online!
user avatar
  • 500
0 votes

Obfuscated Hello World

MUMPS, 85 bytes x $c(86+33,35-3,34,69+3,98+3,99+9,99+9,99+9+3,35-3,93-6,68+43,69+45,99+9,96+4,33,34) Try it online! Meets every rule. The ...
user avatar
1 vote

Obfuscated Hello World

Scratch (scratchblocks3 syntax), 52 bytes (22 characters) 点击绿旗时 说(将[你好世界]译为(英语 v Breaks no rules. Thanks for being one of the only programming languages that gets ...
user avatar
  • 181
1 vote

Obfuscated Hello World

K (ngn/k), 22 bytes {`c$-4+"Lipps${svph%"} Try it online! Quite straightforward.
user avatar
  • 693

Top 50 recent answers are included