moony‭

Challenge Given a list of n numbers and x, compute $a + bx^1 + cx^{2} + ... + zx^{n-1}$, where a is the first value in the list, b is the second, etc. n is at most 256 and at least 0. The input va...

20 answers  ·  posted 5y ago by moony‭  ·  last activity 4y ago by south‭

Your goal is to reverse an ascii string. Given a (optionally newline or null terminated) input, output your input in reverse order, optionally followed by a newline. Terminate afterward. Function...

33 answers  ·  posted 5y ago by moony‭  ·  last activity 1y ago by xrs‭

Challenge Cause the currently running program to receive the SIGSEGV signal (on Linux or other *nix systems) as fast as possible. What it does with the signal doesn't matter as long as it receives...

12 answers  ·  posted 5y ago by moony‭  ·  last activity 6mo ago by mvirts‭

I feel it'd be a good idea to require, or at least heavily encourage, that challenges include an example, ungolfed, readable solution in a non-golf language like Javascript, C, Rust, or Python. Th...

1 answer  ·  posted 5y ago by moony‭  ·  last activity 5y ago by dzaima‭

Post tips for Befunge code golf here! This is based on a type of question I used to see on CGCC, where people would post tips for golfing in various languages. They happened to be quite helpful, s...

3 answers  ·  posted 5y ago by moony‭  ·  edited 4y ago by user‭

I'd like to make a challenge that involves the use of a microcontroller, specifically, a challenge to read any 4-bit Gray Code from 4 IO pins, and convert it to binary. Simple introductory type cha...

1 answer  ·  posted 5y ago by moony‭  ·  last activity 5y ago by Lundin‭

Rust 1.0.0, 58 53 52 37 bytes fn a(){#[no_mangle]static mmap:u8=0;}

posted 5y ago by moony‭  ·  edited 5y ago by moony‭

Golfing numbers Numbers above 15 and below zero take more than one byte to create. Here's a table of numbers up to 100 (Not including negatives yet) Table for '98 NOTE: For numbers that are al...

posted 5y ago by moony‭  ·  edited 5y ago by Moshi‭

Challenge Given a list of n numbers and x, compute $a + bx^1 + cx^{2} + zx^{n-1}$, where a is the first value in the list, b is the second, etc. n is at most 256 and at least 0. The input value(s...

posted 5y ago by moony‭  ·  edited 2y ago by trichoplax‭

Raku, 19 bytes "Hello, World!".say Explanation First second answer of the.. entire site, actually. Nothing special. I don't think this can go shorter, but this is Raku, who actually knows. I m...

posted 5y ago by moony‭  ·  edited 5y ago by moony‭

C, 16 bytes m(){*(int*)m=0;} Try it Online!

posted 5y ago by moony‭

Befunge-98, 45 39 37 33 29 21 bytes v:~< >a-| >v$< ,: ^_@ Try it online! This answer probably sucks :P

posted 5y ago by moony‭  ·  edited 5y ago by moony‭

Bitwise operations (WIP) Befunge, rather pointedly, lacks bitwise ops. No shifts, no and, no or, no xor. Shifts Shifts can be implemented as multiplication and division by powers of two. Shifts...

posted 5y ago by moony‭

Given $ n $ lists of numbers: $$ [A_1, A_2, ..., A_x ] $$ $$ [B_1, B_2, ..., B_y ] $$ $$ [C_1, C_2, ..., C_z ] $$ Join them in a way that the index of each element is preserved. The order betwe...

posted 5y ago by moony‭  ·  edited 5y ago by moony‭

Challenge Identify as many different OEIS sequences as possible in as few bytes as possible. You can output multiple sequences for one input, and your input is at most 10 values long and at least ...

posted 5y ago by moony‭  ·  edited 5y ago by moony‭