Search Results

x86-64 machine code, 10 bytes Fortunately, there is a built-in RNG. Requires the RDRAND instruction. 00000000: c1e1 020f c7f0 abe2 fac3 .......... Disassembled: shl ecx, 2 label: rdr …

Jelly, 12 bytes I wonder if this is the same as caird's answer (it probably isn't, because the control flow here almost certainly can be simplified by anyone who actually knows Jelly, or perhaps even …

C# (Visual C# Interactive Compiler), 53 49 bytes turns out Max can cast chars to codes implicitly I tried a recursive version, but it was longer. Can't think of a way to replace the loop with LINQ.. …

Wolfram Language (Mathematica), 25 bytes This uses a trick: Mathematica doesn't expand Sin[51819] into a proper number even when Max is called on a list of such things, and because of how Last works, …

Sledgehammer, 11 bytes Alternatively, 83 bits. I ended up forgetting to actually answer this with Sledgehammer for a while... ⣜⢍⡪⡱⣰⡵⠅⣧⣼⣅⣸ Compressed from this Wolfram Language code: If[NumberQ[ …

Wolfram Language (Mathematica), 50 49 37 bytes Returns a polynomial. Mathematica is so awesome x+1 can be used as a variable in this context. Apart is a weird built-in that, quoting from the docs, see …

Sledgehammer, 6 bytes ⣈⠲⡎⡒⢢⣑ Only works in the interactive app (that requires excessive amounts of tinkering to get it to actually decompress the Braille code itself, but it's possible), because of a …

Sledgehammer, 4 bytes 31 bits, to be overly specific please upvote the author of this awesome language instead of me ⣶⣖⡥⣕ (this is a very awesome Mathematica compressor, and it really excels at com …

C# (Visual C# Interactive Compiler), 47 46 bytes Much shorter than the beautiful LINQ solutions with SelectMany :( I also cannot remember when I last wrote a for loop while code-golfing, so I likely …