Communities

Writing
Writing
Codidact Meta
Codidact Meta
The Great Outdoors
The Great Outdoors
Photography & Video
Photography & Video
Scientific Speculation
Scientific Speculation
Cooking
Cooking
Electrical Engineering
Electrical Engineering
Judaism
Judaism
Languages & Linguistics
Languages & Linguistics
Software Development
Software Development
Mathematics
Mathematics
Christianity
Christianity
Code Golf
Code Golf
Music
Music
Physics
Physics
Linux Systems
Linux Systems
Power Users
Power Users
Tabletop RPGs
Tabletop RPGs
Community Proposals
Community Proposals
tag:snake search within a tag
answers:0 unanswered questions
user:xxxx search by author id
score:0.5 posts with 0.5+ score
"snake oil" exact phrase
votes:4 posts with 4+ votes
created:<1w created < 1 week ago
post_type:xxxx type of post
Search help
Notifications
Mark all as read See all your notifications »

Search

Advanced Search Options

To further refine your search, you can use additional qualifiers such as score:>0.5. For example, the search score:>=0.5 created:<1y grammar would return only posts mentioning "grammar" that have a score >= 0.5 and were created less than a year ago.

Further help with searching is available in the help center.

Quick hints: tag:tagname, user:xxx, "exact phrase", post_type:xxx, created:<N{d,w,mo,y}, score:>=0.5

Filters
1.5k posts
 
50%
+0 −0
Q&A What's a code bowling challenge?

What's a code bowling challenge? Code bowling is a challenge/competition to solve a particular (usually simple) problem in the most bytes or complexity. From CGCC Are there any additional criteri...

posted 2y ago by General Sebast1an‭

Answer
50%
+0 −0
Challenges Guess the language! (Cops' Thread)

D, cracked by Kevin M. Mansour, 39 bytes void main(){write("Cops and Robbers");} Try it online! This doesn't look like C. Not even BMPL. Now we know why.

posted 2y ago by General Sebast1an‭  ·  edited 2y ago by General Sebast1an‭

Answer
50%
+0 −0
Challenges Bytes to Segfault

Rust, 47 bytes fn main(){unsafe{print!("{}",*(0 as*mut i8));}} Try it online!

posted 2y ago by user‭

Answer
50%
+0 −0
Challenges Guess the language! (Cops' Thread)

Rust, cracked by Shaggy, 37 bytes fn main(){print!("Cops and Robbers")} Try it online! Hold on, lemme translate it for fun: For now, my print not say "Cons and Rubbers". Ahem, sorry, don't ...

posted 2y ago by General Sebast1an‭  ·  edited 2y ago by General Sebast1an‭

Answer
50%
+0 −0
Challenges Guess the language! (Cops' Thread)

F# (.NET Core), cracked by Shaggy, 25 bytes printfn"Cops and Robbers" Try it online!

posted 2y ago by General Sebast1an‭  ·  edited 2y ago by General Sebast1an‭

Answer
50%
+0 −0
Challenges Guess the language! (Cops' Thread)

PicoLisp, cracked by Shaggy, 31 bytes (prinl "Cops and Robbers")(bye) Try it online! Strange language, I know.

posted 2y ago by General Sebast1an‭  ·  edited 2y ago by General Sebast1an‭

Answer
50%
+0 −0
Challenges "Hello, World!"

Java (JDK), 80 bytes class A{public static void main(String[] A){System.out.print("Hello, World!");}} Try it online! This answer, except it's actually runnable.

posted 2y ago by General Sebast1an‭

Answer
50%
+0 −0
Challenges Guess the language! (Cops' Thread)

???, 268 bytes !(115,114,101,98,98,111,82,32,100,110,97,32,115,112,111,67)0|2.~(0,0). 1|0|5.~#.~(0,1).~(0,2)0|4.~#.*(2,0,~(0,5),~(0,2)).~(0,1)-{0|5.~#.~(0,0 ,~(0,1))(0,0,~(0,1)).~#.~(0,~(0,0,2))...

posted 2y ago by Hakerh400‭

Answer
50%
+0 −0
Challenges Backspace an array

Husk, 6 bytes Fo+hx0 Try it online! there's got to be a smarter way to do this with grouping.

posted 3y ago by Razetime‭

Answer
50%
+0 −0
Challenges Evaluation order of an APL n-train

Husk, 8 bytes ηÖ↔mo⌈½ŀ Try it online! Same idea as xash's answer from CGCC.

posted 3y ago by Razetime‭  ·  edited 3y ago by Razetime‭

Answer
50%
+0 −0
Challenges Backspace an array

Japt, 9 bytes ô rÈÔÅÔcY Try it or run all test cases ô rÈÔÅÔcY :Implicit input of array ô :Split on falsey elements (i.e., 0) r :Reduce by È :Passing...

posted 3y ago by Shaggy‭  ·  edited 2y ago by Shaggy‭

Answer
50%
+0 −0
Challenges Prime Difference

Japt, 15 14 bytes @§XnÈj}aX+j}a2 Try it or run all test cases @§XnÈj}aX+j}a2 :Implicit input of integer U @ :Function taking an integer X as argument § ...

posted 3y ago by Shaggy‭  ·  edited 3y ago by Shaggy‭

Answer
50%
+0 −0
Sandbox Recreate modulo [cancelled]

posted 3y ago by General Sebast1an‭  ·  edited 2y ago by General Sebast1an‭

Article code-golf math
50%
+0 −0
Challenges Create a Sudoku

Japt, 10 bytes Outputs a 2D-array. 9õ ñu3 £éX Try it 9õ ñu3\n£éX 9õ :Range [1,9] ñ :Sort by u3 : Mod 3 of each \n :Assign to variabl...

posted 3y ago by Shaggy‭

Answer
50%
+0 −0
Challenges Evens or Odds - you know this one

Python 3, 51 25 bytes n=int(input());print(n%2) Try it online! Golfed 26 bytes using the technique from my PHP answer.

posted 3y ago by General Sebast1an‭  ·  edited 2y ago by General Sebast1an‭

Answer
50%
+1 −1
Meta Is my extension-like library allowed to be used in answers?

If you actually use the library, sure, I guess. How you are going to get it running on online compilers, I have no idea. It's very uninteresting for others to view some code using a custom library ...

posted 3y ago by Lundin‭

Answer
50%
+0 −0
Meta Allow linking account with Code Golf Stack Exchange [duplicate]

In my user preferences in "Edit Profile", under the "Link Stack Exchange Account" heading, this shows up: An association with Code Golf Stack Exchange needs to be added for this site.

1 answer  ·  posted 3y ago by Razetime‭  ·  closed as duplicate 3y ago by Mithical‭

Question support discussion
50%
+0 −0
Challenges Bytes to Segfault

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 b...

posted 3y ago by forestbeasts‭

Answer
50%
+0 −0
Challenges Shape of an array

JavaScript (Node.js), 51 bytes n=[];f=(a)=>a&&a.map?(n.push(a.length),f(a[0]),n):n Run f on your input, e.g. f([[],[]]). Explanation: n=[]; // make a global array to hold the res...

posted 3y ago by forestbeasts‭

Answer
50%
+0 −0
Challenges Prime Difference

JavaScript (Node.js), 81 bytes d=(p,i=2)=>i<p?!(p%i)||d(p,i+1):0 f=(n,a=2,p=a+1)=>d(p)?f(n,a,p+1):p-a<n?f(n,p):a Try it online! Explanation: d is a helper function that returns t...

posted 3y ago by Moshi‭

Answer
50%
+0 −0
Challenges Prime Difference

C (gcc), 126 129 bytes N=9999;f(n){int p[N],i,j,P;memset(p,1,N);for(i=P=2;i*i<N;i++)if(p[i]){for(j=i*i;j<N;j+=i)p[j]=0;i-P>=n?j=N:(P=i);}e:return P;} Try it online! This is an integer...

posted 3y ago by Lundin‭  ·  edited 3y ago by Lundin‭

Answer
50%
+0 −0
Sandbox Balanced quinary quasiquine [FINALIZED]

posted 1y ago by trichoplax‭  ·  edited 1y ago by trichoplax‭

50%
+0 −0
Sandbox Knight safe squares [FINALIZED]

posted 1y ago by trichoplax‭  ·  edited 1y ago by trichoplax‭