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 than others. Keep in mind that if you depend on uninitalized data, it needs to always result in a segfault; a 0.000001% chance to not work invalidates your solution.
Example program
#include <stddef.h>
#include <stdio.h>
int main() {
int* ohno = NULL;
printf("%d", *ohno);
}
C, 5 bytes ```c main; ``` …
9mo ago
[Python 2], 13 bytes …
9mo ago
[JavaScript (Node.js)], 35 32 …
8mo ago
Rust 1.0.0, 58 53 52 37 bytes …
9mo ago
C, 16 bytes ```c m(){(int)m= …
9mo ago
[Bash], 11 kill -11 …
8mo ago
C (compliant), 19 bytes (`g …
8mo ago
[Rust], 47 bytes fn …
2d ago
Swift 5.4, 17 bytes ``` fu …
2mo ago
9 answers
C, 5 bytes
main;
This exploits the fact that uninitialised globals live in the .bss section, and that section is not executable. So any attempt to execute code there, regardless of content, will cause a segfault.
C, 16 bytes
m(){*(int*)m=0;}
Swift 5.4, 17 bytes
func f(){f()};f()
Pretty simple. It just calls itself until it stack overflows. You need to compile and run it, not just do it in the REPL, because the REPL just drops you back into the interpreter once it overflows.
It gives a warning "all paths through this function will call itself", but eh who cares?
0 comment threads
0 comment threads