Questions tagged [code-golf]
For questions about code golf challenges and/or submissions. DO NOT post code golf challenges themselves as questions here; those belong on the main site or in the Sandbox if you want to get feedback on them.
13
questions with no upvoted or accepted answers
54
votes
0
answers
2k
views
How to count bytes FAQ
We've got a lot of questions asking how to count the bytes in different situations. This question is here to put them all in one spot.
General questions
How to count "interactive" answers ...
15
votes
0
answers
174
views
Advent of Code Golf 2021 is over! (Stats, Hall of Fame)
Advent of Code Golf 2021 is over!
Thanks to everyone who participated in and/or helped me run the Advent of Code Golf 2021 event. It wouldn't have been so successful without the help of the community.
...
- 70.2k
6
votes
1
answer
151
views
Does the initial `:` in a TI-BASIC program count?
According to this meta post, TI-BASIC is scored in tokens rather than characters, to more accurately reflect the byte count in-memory.
On my graphing calculator (TI-84 Plus C Silver Edition), the ...
- 2,278
4
votes
0
answers
116
views
How should answers that time out be judged?
Suppose a challenger submits a code-golf challenge to do a particular task, together with test inputs. (That is, they've determined that, in order to be convinced that the code in an answer correctly ...
- 407
4
votes
0
answers
191
views
How to handle large, complex challenges and built-ins?
I want to make a complicated code golf challenge (with a time limit ;). In this particular case I want people to golf the Elliptic-Curve Method to factorization.
Now there are two issues with ...
- 3,343
3
votes
0
answers
33
views
Can machine code be separated into several parts with fixed distance?
Opcode can have JMP command jumping to an address that also mean another instruction:
...
- 17.1k
2
votes
0
answers
78
views
Is asking for a bounded time complexity allowed?
Say, if someone asks for a code-golf like this:
Test primality under polynomial time
Given a positive integer, test whether it is prime.
Rules
The algorithm must have polynomial time complexity in ...
- 4,637
2
votes
0
answers
401
views
Atomic Golf COBOL (IBM Enterprise COBOL)
Just to make it clear, Atomic Golf COBOL will not be a competitive golfing language. The longer the shortest answer (80+, the longer the better) the more possible to get close, however, COBOL is very ...
- 1,461
1
vote
0
answers
62
views
What loopholes should be assumed when a name-specific file is used for code golf?
I have posted this golfing tip for Bash before:
In Pure Bash (or any other pure shellscript), use . for looping.
It's a tip that recomments using a file whose the ...
user100411
1
vote
0
answers
68
views
Can we assume computer be fast enough?
Consider such a question
Take a program P and an integer n, check whether P halts. You may ...
- 17.1k
1
vote
0
answers
53
views
Are kernel-mode functions and kernel modules valid code-golf answers?
In general, user-mode processes have a much richer API environment available (through stdlib, and other libraries you can possibly import), than does (Linux) kernel-mode code. However there are some ...
- 71k
1
vote
0
answers
125
views
Is the interpreter part of the language or a separate language?
As I understand it, for our purposes a language is more or less defined by its implementation. That's one of the reasons why a program like Vim can also be "language". You just count keystrokes ...
- 241
-2
votes
1
answer
136
views
New code-golf metric : Efficiency*characters
So, I thought about a new metric of code-golf, the code with the smallest value wins. The value is calculated by characters*time to run. So if you use an programming language like python, it's very ...
- 535