You'll be given the name of one of the 20 biggest objects in the Solar System. Your task is to return an approximation of its radius, expressed in kilometers.
This is a code-challenge where your score consists of the size of your code (in bytes), increased by a penalty based on your worst approx...
Introduction:
I have loads of different ciphers stored in a document I once compiled as a kid, I picked a few of the ones I thought were best suitable for challenges (not too trivial, and not too hard) and transformed them into challenges. Most of them are still in the sandbox, and I'm not sure ...
Progressive APEG - ASCII Pictures Expert Group
Sometimes, you get stuck on a poor connection, and even ASCII art seems to take forever to load. When you just want to see if it's worth loading the full picture quickly, wouldn't it be nice to have a progressive ASCII art format, which gives you a ...
As a follow up to Shortest terminating program whose output size exceeds Graham's number and Golf a number bigger than TREE(3), I present a new challenge.
Loader's number is a very large number, that is kind of hard to explain (since it was itself the result of a code golfing exercise with a fle...
Given an input n, write a program or function that outputs/returns the sum of the digital sums of n for all the bases 1 to n.
$$n + \sum_{b=2}^n \sum_{i=0}^\infty \left\lfloor \frac{n}{b^i} \right\rfloor \bmod b$$
Example:
n = 5
Create the range [1...n]: [1,2,3,4,5]
For each element x, g...
I'm looking for an implementation for a function f that:
takes as input a byte and returns as output another byte
is a permutation of the 256 possible values 0, 1, ..., 255 of a byte
makes use of few simple operators like: addition, multiplication, bitwise and, or, xor, bit shift; and few memo...
1000000000 and I are currently offering a indefinite bounty of up to 1100 reputation (details here) for a solution to this challenge that beats the current best
Mini-Flak is a subset of the Brain-Flak language, where the <>, <...> and [] operations are disallowed. Strictly speaking it must ...
