Activity for moony‭

Type	On...	Excerpt	Status	Date
Article	—	Interleave multiple arrays at once Given $ n $ lists of numbers: $$ [A1, A2, ..., Ax ] $$ $$ [B1, B2, ..., By ] $$ $$ [C1, C2, ..., Cz ] $$ Join them in a way that the index of each element is preserved. The order between elements with the same index does not matter. Sorted: $$ [A1, B1, C1, ..., Ax, By, Cz] $$ Arbitrary, ... (more)	—	about 3 years ago
Question	—	Microcontroller-involving challenges and the rules. 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 challenge. Problem, of course, is we have no set precedents for this type of challenge. A few questio... (more)	—	about 3 years ago
Answer	—	A: Befunge Golfing Tips 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 by arbitrary amounts can be done with successive multiplication/division by two. Rendered tricky by n... (more)	—	over 3 years ago
Answer	—	A: Befunge Golfing Tips 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 also valid ASCII characters, it can be smaller to use `" "` to insert them. This isn't included in the t... (more)	—	over 3 years ago
Question	—	Befunge Golfing Tips 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, so I thought it'd be nice to bring them back. (more)	—	over 3 years ago
Article	—	Largest finite output Your goal is to output the longest finite string of data, with known length (no RNG!) Your score is $outputlen/bytecount$, competing on a per-language basis. Specify the byte count, output length in bytes, and final score in your answer's header. (more)	—	over 3 years ago
Answer	—	A: Reverse an ASCII string Befunge-98, 45 39 37 33 29 21 bytes ``` v:a-| >v$< ,: ^@ ``` Try it online! This answer probably sucks :P (more)	—	over 3 years ago
Question	—	Reverse an ASCII string 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 answers will not be given a newline, and are not expected to output one unless they print the answer to... (more)	—	over 3 years ago
Question	—	Do we require codegolf challenges include example code? 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. This would augment the challenge's description with a known-working solution contestants can use as a gu... (more)	—	over 3 years ago
Answer	—	A: Bytes to Segfault Rust 1.0.0, 58 53 52 37 bytes ```rust fn a(){#[nomangle]static mmap:u8=0;} ``` (more)	—	over 3 years ago
Answer	—	A: Bytes to Segfault C, 16 bytes ```c m(){(int)m=0;} ``` Try it Online! (more)	—	over 3 years ago
Question	—	Bytes to Segfault 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 it. This is code golf, smallest answer in each language wins. Some languages will have a tougher time... (more)	—	over 3 years ago
Article	—	OEIS Identification 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 one. You must not mislabel an input, i.e. `2, 3, 4, 5` cannot be identified as A000040. A subset of a... (more)	—	over 3 years ago
Question	—	Evaluate a single variable polynomial equation 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) can be any 32-bit float Input can be in any format of choice, as long as it is a list of num... (more)	—	over 3 years ago
Answer	—	A: "Hello, World!" 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 made this post to (possibly) try and set a precedent for what a answer should look like. Obv you ... (more)	—	over 3 years ago
Article	—	Evaluate a univariate polynomial [FINALIZED] 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) can be any 32-bit float Input can be in any format of choice, as long as it is a list of numbers ... (more)	—	over 3 years ago