Activity for moony
| Type | On... | Excerpt | Status | Date |
|---|---|---|---|---|
| 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 |
| Edit | Post #279414 |
Post edited: |
— | over 3 years ago |
| Edit | Post #279415 | Initial revision | — | 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 |
| Edit | Post #279414 |
Post edited: |
— | over 3 years ago |
| Edit | Post #279414 | Initial revision | — | 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 |
| Comment | Post #279382 |
To summarize: If it compiles, regardless of how awful, warning filled, and evil it is, and runs, and gives the desired output, it's a valid answer. Just specify which version of GCC. The return 0 being absent doesn't fail the challenge on GCC version whatever, so GCC version whatever is the language.... (more) |
— | over 3 years ago |
| Edit | Post #279159 |
Post edited: |
— | over 3 years ago |
| Comment | Post #279159 |
@Adam Effectively yes, and i don't feel like going back to change that to "correctly ordered list of numbers", so go for it (more) |
— | over 3 years ago |
| Edit | Post #279204 |
Post edited: |
— | over 3 years ago |
| Edit | Post #279204 |
Post edited: |
— | over 3 years ago |
| Edit | Post #279204 |
Post edited: |
— | over 3 years ago |
| Edit | Post #279204 |
Post edited: |
— | over 3 years ago |
| Comment | Post #279204 |
Can you elaborate on the first point? And yea, i'm aware of those, hence me needing to do more work on scoring. An example for the first point would be nice. (more) |
— | over 3 years ago |
| Edit | Post #279204 |
Post edited: wwat |
— | over 3 years ago |
| Edit | Post #279204 |
Post edited: |
— | over 3 years ago |
| Edit | Post #279204 |
Post edited: |
— | over 3 years ago |
| Edit | Post #279204 | Initial revision | — | 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 |
| Edit | Post #279155 |
Post edited: forgot how TIO works |
— | over 3 years ago |
| Edit | Post #279148 |
Post edited: |
— | over 3 years ago |
| Edit | Post #279155 |
Post edited: |
— | over 3 years ago |
| Edit | Post #279155 |
Post edited: |
— | over 3 years ago |
| Edit | Post #279166 | Post edited | — | over 3 years ago |
| Suggested Edit | Post #279166 |
Suggested edit: (more) |
helpful | over 3 years ago |
| Edit | Post #279155 |
Post edited: |
— | over 3 years ago |
| Edit | Post #279159 | Initial revision | — | 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 |
| Edit | Post #279148 |
Post edited: |
— | over 3 years ago |
| Edit | Post #279148 |
Post edited: trying to make mathjax cooperate |
— | over 3 years ago |
| Edit | Post #279155 |
Post edited: nope, second |
— | over 3 years ago |
| Edit | Post #279155 | Initial revision | — | 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 |
| Comment | Post #279148 |
@22t: It’s just basic math, substituting in the variables and solving for the answer of the filled in equation (more) |
— | over 3 years ago |
| Edit | Post #279148 |
Post edited: |
— | over 3 years ago |
| Edit | Post #279148 |
Post edited: |
— | over 3 years ago |
| Edit | Post #279148 | Initial revision | — | 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 |
| Comment | Post #279147 |
@mbomb007 I imagine nothing. Some challenges may make sense to copy over as not everyone wants to use SE (some still have bitter feelings about it)
However, I think people will have some incentive to be creative and make new challenges anyways. (more) |
— | over 3 years ago |
- ← Previous
- 1
- 2
- Next →