New answers tagged

1

MathGolf, 23 22 bytes )└"miss a few"♀┐\]û, u Try it online. Explanation: ) # +1 (since the stack is empty, it'll use an implicit 0) └ # Push the top of the stack + 1 (without popping) "miss a few" # Push string "miss a few" ♀ # Push 100 ┐ ...


1

JavaScript (V8), 30 bytes for(i=0;+!print(i)+'00'-i++;); Try it online! Jo king saves more bytes that I can count :)


0

!@#$%^&*()_+, 34 bytes ^!# ,@@^# ,wef a ssim ,(@)c# ,@@d# Try it online! Explaination: ^!# ,@@^# ,wef a ssim ,(@)c# ,@@d# (implicit push 0) ^ Top of stack += 1 !# Output Top of stack as number without popping ,@@ Output ", " ^ ...


2

!@#$%^&*()_+, 13 bytes e($!#^$_^_ @) Try it online! Explaination: e($!#^$_^_ @) e Pushes 101 onto the stack ( While $ Swap !# Output number without popping and newline ^ Top of stack = Top of stack + 1 $ Swap _^_ Top of stack = Top of stack - 1 <newline> Push 10 @ ...


0

TI-Basic, \$10 \uparrow\uparrow 5.0039\$ (I think), 100 bytes {π,Xmax→L₁ Ans→L₂ LinReg(ax+b) Y₁ Equ▸String(Y₁,Str1 If not(N sub(Str1,Xscl,Xscl→Str2 Σx For(J,-Ans,Ans Ans+Ans→A End For(I,I-A,I-Xscl IS>(N,A prgmD DS<(N,Z Str2+Str2→Str2 End Ans a fresh interpreter/calculator is needed, or with the following constants initialized: N,Z,I = 0 Xscl = 1 Xmin =...


2

JavaScript (V8), 52 39 bytes for(i=0;!print(i)>=~-(''+i++).length;); Try it online! Thanks Jo king Original version : JavaScript (V8), 52 48 bytes for(i=0;i<=(c=" ".length)*-~c*-~c;)print(i++) Try it online! Not the shortest by any margin Explanation : for(i = 0; // simple for loop i <= (c=" ".length)*~-c*~-c; ...


1

Oracle SQL, 56 bytes select level-cos(0)from dual connect by level<ascii('f') Try it online!


2

Java 106 bytes class p {public static void main(String[] args){int i='A'/'A';while(i<=(int)'d')System.out.println(i++);}}}} TIO


1

MathGolf, 4 bytes ♀)rn Outputs with newline delimiter. Try it online. Explanation: ♀ # Push 100 ) # Increment it to 101 r # Pop and push a list in the range [0,101) n # Pop and join it by newlines # (after which the entire stack is output implicitly)


1

TI-Basic, \$7.37 \times 10^{127} / 56^3 \approx 10 \uparrow\uparrow 3.31985\$ Tmax+Tmax+e→Z Ans+Ans+Ans+Ans+Ans→X cosh(Ans+Ans+Ans→Y For(I,~π,X+Z For(Y,Y,Y,Y End End Y Higher score now thanks to MarcMush.


1

Java (JDK) v0.0.1: \$6.3\times 10^{72^{5}}/96^3\approx10\uparrow\uparrow3.96786\$ q->{int a='\t'+'\t',b=a+a,c=b+b;return(""+b).repeat(b).repeat(c).repeat(c).repeat(c).repeat(c);} Try it online! v0.1.1: \$\left(10^{1762613844998129336721604609} - 1\right)/96^3 \approx 10 \uparrow\uparrow 4.15694\$ i->{int n='\t',a=n-n,c=a,b=n<<n+n+n;...


1

Mathematica, 10↑↑3.320198 10↑↑3.869893 1010485761048576*210485762 ≈ 10↑↑6.0258976 p=⌈Pi⌉;a=Table[#,p,p,p,p,p,p,p,p,p,p]&;p=Total[a[p],p];""<>Nest[Nest[(a=a@*a)@#&,#,p]&,ToString@p,p] Explanation: p=⌈Pi⌉; Straightforwardly, sets p to 4 a=Table[#,p,p,p,p,p,p,p,p,p,p]&; Assigns a to be the function to make a 10-dimentional '...


1

Lean Mean Bean Machine, 50 bytes OOO 95" (/ * / u! / " b ! " y ! " t ! " e ! " s U Try it Online! This was a lot of fun, as messy as it is. Explanation This section handles the number: OO 95 (/ * u It spawns 2 marbles, the left one is set to 9, then incremented (with (), and the right one is set to 5, then shunted to the left ...


0

TI-Basic, 27 BYTES Text(0,0,3*3²," BYTES outputs on the graph. Text( allows to chain things to output, which Output( or Disp don't allow there is probably room for improvement with one of those 27 in 2 or 3 bytes is possible but useless (3^3, 3³) 26 in 3 bytes 25 in 2 bytes (5² not valid) 24 in 1 byte ?? This solution should work on all TI-83 and 84. ...


1

Vyxal ṡ, 7 6 bytes -1 bytes thanks to Bubbler kṄt`¨ƈ Explanation kṄ - Push "4096" t - Get the final item (6) `¨ƈ - Push "bytes" <flag> - Join by spaces ("6 bytes") <implicit> - Print it. Try it Online!


0

Python 3, 34 bytes print(f'{chr(51)}{chr(52)} bytes') Try it online!


0

PEP8 Assembly, 50 bytes STRO 4,d STOP .WORD 13616 .ASCII " BYTES" .END 13616 is "50" in ASCII A programming language made as an introduction to assembly and low-level concepts. Not sure I've seen it used here before, so might be a first?


1

Vyxal, 5228096860937807017 bytes, beats lyxal ...Who says I need inf to win? klkl₃₃kl₃₃kWsĖ Try it Online! This ended up being really complicated, until I realized I was an idiot. At first, I had a really big thing to get the last letter of a string, then I realized that that was stupid and I was stupid and Vyxal is stupid and I'm stupid, and I could remove ...


1

GFortran, 29 bytes try it online! print*,(j,j=0,ichar('d')) end Similar to this.


1

Vyxal, score 250, cracked properly by Aaroneous !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVXYZ[\]^_`abcdefghijmnopqrtuvwxyz{|}~¡¢£¤¥¦§¨«¬¯°±²µ¶¹»¼½¾×Þßæð÷øĊċėĠġİĿŀŻżƈƒƛǍǎǏǐǑǒǓǔȦȧȮȯɖɽɾʀʁΠβελτḂḃḊḋḞḟḢḣḭṀṁṄṅṖṗṘṙṠṡṪṫẆẇẊẋẎẏ‛„‟†‡•…‹›⁋⁰⁺⁼⁽₀₁₂₄₅₆₇₈₌₍€₴℅⅛←↑→↓↔↲↳↵⇧⇩∆∇∑√∞∧∨∩∪∴∵∷≈≠≤≥≬⊍⋎⋏⌈⌊⌐□⟇⟑⟨⟩꘍ꜝ Frick you with your bullcrap inf. That stops ...


3

Shakespeare Programming Language, 218 bytes ,.Puck,.Ajax,.Act I:.Scene I:.[Exeunt][Enter Puck and Ajax]Puck:Open heart.You is the sum ofyou a cat.Ajax:You is twice the sum ofa big big cat a cat.Speak mind!You is the square ofyou.Is I nicer you?If notlet usAct I. Try it online! This is a golfed version based off of Dr Lemniscate's answer, with several non-...


1

Vyxal, 102953210 bytes, makes lyxal very sad Y'all'dn't've given me those deltas. kl¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯s¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯℅ Try it Online! So it turns out that using deltas on a string or a list of characters will just remove the last character if all the characters are different. Removing a bunch of stuff, sorting, then removing a bunch of ...


2

Julia 1.0, 45 bytes print(string(:([Hello World!]))[-~-~0:~-end]) Try it online! This is not cheating (I think) :(...) is an Expr, which represents Julia code (AST or something) [Hello World!] is a 2 by 1 Matrix containing two variables Hello and World!. They don't need to be defined since they are in an Expr (internally stored as Symbols) string turns ...


2

Vyxal, score 250, cracked by aaroneous !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijmnopqrtuvwxyz{|}~¡¢£¤¥¦§¨«¬°±²µ¶¹»¼½¾×Þßæð÷øĊċėĠġİĿŀŻżƈƒƛǍǎǏǐǑǒǓǔȦȧȮȯɖɽɾʀʁΠβελτḂḃḊḋḞḟḢḣḭṀṁṄṅṖṗṘṙṠṡṪṫẆẇẊẋẎẏ‛„‟†‡•…‹›⁋⁰⁺⁼⁽₀₁₂₃₄₅₆₇₈₌₍€₴⅛←↑→↓↔↲↳↵⇧⇩∆∇∑√∞∧∨∩∪∴∵∷≈≠≤≥≬⊍⋎⋏⌈⌊⌐□⟇⟑⟨⟩꘍ꜝ So this is how emanresuA felt.


3

Vyxal, 3407394222061762112 bytes, ccrks lllxal' [hopes and dreams] HEY EVERY!! IT'S 3VERY BUDDY'S FAVORITE [[number 1 rated cracker 1997]] klkW₆Ė₆₆₆ĖĖssVĖ₆VkWVkW₆Ė₆₆₆ĖĖssVĖ₆VkWVkW₆Ė₆₆₆ĖĖssVĖ₆VkWVkW₆Ė₆₆₆ĖĖssVĖ₆VkWVkW₆Ė₆₆₆ĖĖssVĖ₆VkWV₆kl₆₆₆₆ĖĖssVĖ₆VĖ₆₆₆ĖĖssVĖ₆V Try it Online! Yeah I know there're 4's in there, [DEAL] with it. The backbone of this solution is ...


0

Pascal (FPC), 1245 bytes it's kinda long and crazy ngl {$macro on} {$define _O:=chr(Length(} {$define O_:=))} begin write(_O'000000000000000000000000000000000000000000000000000000000000000000000000'O_,_O'00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000'O_,_O'...


2

I just saw the last comment… However I believe this is valid C++: #include <cstdio> int main(int argc, char**) { while (argc != 1001 and std::printf("%d, ", argc++)) {} } compiler explorer


1

C++ gcc, 36 bytes Try it online! main(){for(;_<'e';)cout<<_++<<'\n';} Explanation : I globally initialized varible _ so its initial value is 0, now ascii value of e is 101 so I ran the loop till my variable _ is less than 'e', instead of incrementing it inside the for loop I used post increment while printing to save 1 byte edit: I misread ...


2

AWK, 35 34 bytes END{for(i=0;i<=0xA*0xA;)print i++} Try it online! -1 byte thanks to me


1

Vim, 16 bytes i0<Esc><C-a>s<C-r>=r <C-r>"0<C-r>") Try it online! Explanation: i0<Esc> # Insert `0` <C-a> # Increment s # Delete into register " and Insert <C-r>= ...


4

Zig, 63 66 47 72 bytes fn a()void{for(" "**'e')|_,i|{@import("std").debug.print("{d} ",.{i});}} Try it online! I've excluded the @import() boilerplate as it seems analogous to C's #include, which is excluded from other answers. If deemed necessary, I will add it back in. Explanation fn a() void { for (" " ** 'e') ...


1

Vyxal so, score 249, fricking gosh dang cracked by aaron !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUXYZ[\]^_`abcdefghijmnpoqrtuvwxyz{|}~¡¢£¤¥¦§¨«¬¯°±²µ¶¹»¼½¾×Þßæð÷øĊċėĠġİĿŀŻżƈƒƛǍǎǏǐǑǒǓǔȦȧȮȯɖɽɾʀʁΠβελτḂḃḊḋḞḟḢḣḭṀṁṄṅṖṗṘṙṠṡṪṫẆẇẊẋẎẏ‛„‟†‡•…‹›⁋⁰⁺⁼⁽₀₁₂₃₄₅₇₈₌₍€₴℅⅛←↑→↓↔↲↳↵⇧⇩∆∇∑√∞∧∨∩∪∴∵∷≈≠≤≥≬⊍⋎⋏⌈⌊⌐□⟇⟑⟨⟩꘍ꜝ Commit utter frick.


3

Vyxal, 464251237 bytes' ,lyxal crakcs anser Hey look, more negative numbers and indexing into printable ascii! How negative numbers? kokoĖPĖkokoĖPĖkoĖĖkPkPkPkPkoPkoĖĖPPPPPkokoĖPĖkokoĖPĖkoĖĖkPkPkoPkoĖĖPPPĖkoPPkPkPkPkPkoPkoĖĖPPPPPĖ We can decrement to any number by stringing many of these snippets together into a series. This is pretty much the same as ...


1

Vyxal so, score 249, cracked by aaroneous !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLNOQRSTUVXYZ[\]^_`abcdefghijlmnpqrtuvwxyz{|}~¡¢£¤¥¦§¨«¬¯°±²µ¶¹»¼½¾×Þßæð÷øĊċėĠġİĿŀŻżƈƒƛǍǎǏǐǑǒǓǔȦȧȮȯɖɽɾʀʁΠβελτḂḃḊḋḞḟḢḣḭṀṁṄṅṖṗṘṙṠṡṪṫẆẇẊẋẎẏ‛„‟†‡•…‹›⁋⁰⁺⁼⁽₀₁₂₃₄₅₆₇₈₌₍€₴℅⅛←↑→↓↔↲↳↵⇧⇩∆∇∑√∞∧∨∩∪∴∵∷≈≠≤≥≬⊍⋎⋏⌈⌊⌐□⟇⟑⟨⟩꘍ꜝ We partake in a mild amount of tomfoolery.


4

Vyxal, 97330683540476391235 bytes ,cracker'sd lyxal's answre Sample: ...


0

CLC-INTERCAL, A001477, safe, score: 14. Byteset: ACFGIJLPRWX[\_ Rules You may use any compiler option. You may specify i/o format by yourself. You may specify range of input. You may specify whether 0-indexed or 1-indexed. I made a program that works on this online environment. Answer IXRJFPAFL[\W_IXJACIXGP[\W This is DOWRITEIN.1DOREADOUT.1 in Baudot ...


1

Vyxal so, score 248, cracked by EmanresuA !"#$%&'()*+,-./023456789:;<=>?@ABCDEFGHIJKLNOQRSTUVXYZ[\]^_`abcdefghijlmnpqrtuvwxyz{|}~¡¢£¤¥¦§¨«¬¯°±²µ¶¹»¼½¾×Þßæð÷øĊċėĠġİĿŀŻżƈƒƛǍǎǏǐǑǒǓǔȦȧȮȯɖɽɾʀʁΠβελτḂḃḊḋḞḟḢḣḭṀṁṄṅṖṗṘṙṠṡṪṫẆẇẊẋẎẏ‛„‟†‡•…‹›⁋⁰⁺⁼⁽₀₁₂₃₄₅₆₇₈₌₍€₴℅⅛←↑→↓↔↲↳↵⇧⇩∆∇∑√∞∧∨∩∪∴∵∷≈≠≤≥≬⊍⋎⋏⌈⌊⌐□⟇⟑⟨⟩꘍ꜝ The final challenge.


2

Vyxal, 239993933 bytes, lyxal get cracked on The backbone of this solution is the generation of arbitrary negative numbers, allowing for indexing to get all the commands we need. How negative numbers? u # Push -1 koo # Remove `01234567` Does nothing except convert to string Ė # Execute We can decrement to any number by stringing many of these ...


1

Vyxal D, score 244, cracked by Aaroneous ḟṙIcKġ₴…‹›+*/-d↵Ǎ½ƒɖø∆₈₇∞₆₄JiẎȯht42069ḢṪḣṫ¡Þ₀₁C!¬⇧İNeVERgȮṄnaGḭ⟇ėyOU⊍p⇩Ż÷«»⌐m≬\ṡ∷‡⁽⟨|⟩‟„$∇_Ǐq꘍₍₌Π⁺βτʀʁɾɽ¨żẏ?¹⁰²ǔǓǒǑǐǎꜝ₂₃₅&ẇŀl↑↓∴∵¢`;¥£¾F¼⅛%→←"ẋ¤Ḋε€ṗṖ¦†ḃL¶ðZṘ↲↳⋏⋎⁋×λ√⌈⌊:Dbjwxz,BHMQSTXY)}]([{<>ḂĊḞĿṀṠẆẊ℅@°•ß↔æƈ§≈µ¯±≠⁼≥≤=∩s∪ĠṁȦ'ċḋṅ13578ȧ∧⟑∨^rA□f.∑W It's so sad that the last answer died of sigma.


2

Attache, 243 bytes {`+^^(_[0...#_]|{[[_,alpha[_2[ascii[33:58],_]]]["Z@"<_∧_<"["],NTS[20363848091226750223144960725905269888206028302]@_2[NTS[6060454347787589083238889994600682623947941084],_]]["z`"<_∧_<"{"]}&_2)}&({[`0,[$,`_3][_@_3=_2]][_3<#_][_,_2,_3+1]}&0) Try it online! At first, I wasn't ...


5

Vim, 5 bytes VgUu$ Full Program: V # Enter Visual Line mode gU # Change all characters to UPPERCASE u # Undo $ # Go to end of line UPPERCASE PROGRAM: V # Enter Visual Line mode U # Convert all characters to UPPERCASE $ # Go to end of line lowercase program: gu$ # Convert all letters to lowercase from here to end of line


4

Vyxal, 29401143 bytes, lyxal get cracked on The backbone of this solution is the generation of arbitrary negative numbers, allowing for indexing to get all the commands we need. How negative numbers? u # Push -1 .o # Remove `0.5` Does nothing except convert to string Ė # Execute We can decrement to any number by stringing many of these snippets ...


1

Vyxal D, score 239, cracked by Aaron ḟṙIcKġ₴…‹›+*/-d↵Ǎ½ƒɖø∆₈₇∞₆₄JiẎȯht42069ḢṪḣṫ¡Þ₀₁C!¬⇧İNeVERgȮṄnaGḭ⟇ėyOU⊍p⇩Ż÷«»⌐m≬\ṡ∷‡⁽⟨|⟩‟„$∇_Ǐq꘍₍₌Π⁺βτʀʁɾɽ¨żẏ?¹⁰²ǔǓǒǑǐǎꜝ₂₃₅&ẇŀl↑↓∴∵¢`;¥£¾F¼⅛%→←"ẋ¤Ḋε€ṗṖ¦†ḃL¶ðZṘ↲↳⋏⋎⁋×λ√⌈⌊:Dbjwxz,BHMQSTXY)}]([{<>ḂĊḞĿṀṠẆẊ℅@°•ß↔æƈ§≈µ¯±≠⁼≥≤=∩s∪ĠṁȦ'ċḋṅ13578ȧ∧⟑∨^rA No logic. No range. No Any.


1

Vyxal, 29261004498694420 bytes, cracks'd lYXAL;s anser This solution has two main parts to it: Generating arbitrary numbers, and converting those numbers into characters. Arbitrary numbers: uAuAuuArv∨v∧∑ Explanation: uA # Push 1 u r # Cast to range [-1..n) uAuA v∨v∧ # Change all numbers in range to 1 ∑ # Sum ...


1

Vyxal D, score 233, cracked by aaroneous Miller ḟṙIcKġ₴…‹›+*/-d↵Ǎ½ƒɖø∆₈₇∞₆₄JiẎȯht42069ḢṪḣṫ¡Þ₀₁C!¬⇧İNeVERgȮṄnaGḭ⟇ėyOU⊍p⇩Ż÷«»⌐m≬\ṡ∷‡⁽⟨|⟩‟„$∇_Ǐq꘍₍₌Π⁺βτʀʁɾɽ¨żẏ?¹⁰²ǔǓǒǑǐǎꜝ₂₃₅&ẇŀl↑↓∴∵¢`;¥£¾F¼⅛%→←"ẋ¤Ḋε€ṗṖ¦†ḃL¶ðZṘ↲↳⋏⋎⁋×λ√⌈⌊:Dbjwxz,BHMQSTXY)}]([{<>ḂĊḞĿṀṠẆẊ℅@°•ß↔æƈ§≈µ¯±≠⁼≥≤=∩s∪ĠṁȦ'ċḋṅ13578ȧ lol


2

Vyxal, 2513525 bytes, cracks lyxal's answer Samplez: ðḃðḃZðḃZðḃZðḃZðḃZðḃZðḃZðḃZðḃZðḃZðḃZðḃZðḃZðḃZðḃZðḃZðḃZðḃZðḃZðḃZðḃZðḃZðḃZðḃZðḃZðḃZðḃZðḃZðḃZðḃZðḃZðḃZðḃZðḃZðḃZðḃZðḃZðḃZðḃZðḃZðḃZðḃZðḃZðḃZðḃZðḃZðḃZðḃZðḃZðḃZðḃZðḃZðḃZðḃZðḃZðḃZðḃZðḃZðḃZðḃZðḃZðḃZðḃZðḃZðḃZðḃZðḃZðḃZf∑k^ṘðḃðḃZðḃZf∑kv‛ouoṘkv‛ouoð¶rðḃZðḃZfṘZf∑ṘĖZf∑ðḃoZf∑ĖĖ ez Generator: `ḟṙIcKġ₴…‹›+*/-d↵Ǎ½ƒɖø∆₈₇∞₆₄...


0

JavaScript, 4 functions Number Casts its argument to a number format. Leaves numbers unchanged. BigInt Casts its argument to a BigInt. Leaves BigInts unchanged. A BigInt is technically an integer. x=>x The identity function expressed using a lambda. [][(![]+[])[+[]]+(![]+[])[!+[]+!+[]]+(![]+[])[+!+[]]+(!![]+[])[+[]]][([][(![]+[])[+[]]+(![]+[])[!+[]+!+[]...


3

Vyxal D, score 229, crakd by Aaron ḟṙIcKġ₴…‹›+*/-d↵Ǎ½ƒɖø∆₈₇∞₆₄JiẎȯht42069ḢṪḣṫ¡Þ₀₁C!¬⇧İNeVERgȮṄnaGḭ⟇ėyOU⊍p⇩Ż÷«»⌐m≬\ṡ∷‡⁽⟨|⟩‟„$∇_Ǐq꘍₍₌Π⁺βτʀʁɾɽ¨żẏ?¹⁰²ǔǓǒǑǐǎꜝ₂₃₅&ẇŀl↑↓∴∵¢`;¥£¾F¼⅛%→←"ẋ¤Ḋε€ṗṖ¦†A↲↳⋏⋎⁋×λ√⌈⌊:Dbjwxz,BHMQSTXY)}]([{<>ḂĊḞĿṀṠẆẊ℅@°•ß↔æƈ§≈µ¯±≠⁼≥≤=∩s∪ĠṁȦ'ċḋṅ13578ȧ Now do it without string decompression. Edit: Dang.


3

Vyxal, 9942694705621871183448638796 bytes, cracks lyxal's answer Sample: kPkPkPL‛∧∑ĖokPkPkPL‛∧∑ĖokPL‛∧∑ĖokPkPkPL‛∧∑ĖokPkPkPL‛∧∑ĖokPL‛∧∑ĖokPL‛∧∑ĖokPkPkPL‛∧∑ĖokPkPkPL‛∧∑ĖokPL‛∧∑ĖokPkPkPL‛∧∑ĖokPkPkPL‛∧∑ĖokPL‛∧∑ĖokPL‛∧∑ĖokPL‛∧∑ĖokPL‛∧∑Ė Try it Online! This is a purely theoretical program, as there is no way to run it at all. So, basically with the snippet kPL‛∧...


3

Vyxal, score 232, cracked by EmanresuA ḟṙIcKġ₴…‹›+*/-d↵Ǎ½ƒɖø∆₈₇∞₆₄JiẎȯht42069ḢṪḣṫ¡Þ₀₁C!¬⇧İNeVERgȮṄnaGḭ⟇ėyOU⊍p⇩Ż÷«»⌐m≬\ṡ∷‡⁽⟨|⟩‟„$∇_Ǐq꘍₍₌Π⁺βτʀʁɾɽ¨żẏ?¹⁰²ǔǓǒǑǐǎꜝ₂₃₅&ẇŀl↑↓∴∵¢`;¥£¾F¼⅛%→←"ẋ¤Ḋε€ZȧṗṖ¦†A↲↳⋏⋎⁋×λ√⌈⌊:Dbjvwxz,BHMQSTWXY)}]([{<>ḂĊḞĿṀṠẆẊ℅@°•ß↔æƈ§≈µ¯±≠⁼≥≤=ḃ∩s∪ĠṁȦ'ċḋṅ13578 We do a little trolling.


Top 50 recent answers are included