« first day (3513 days earlier)      last day (1370 days later) » 

12:01 AM
It's actually good for recurring events, because it gives a pointer to the latest event and makes clear that the old one is no longer accepting submissions.
Just that I've seen such thing only on meta, not on main (unless the Kolakoski repost counts)
12:25 AM
@pppery I think codington crescent is a different case
What's different? It's basically identical to De-interleave log lines being closed as a duplicate of De-interleave log lines: HARD MODE, for example
Old one closed as a dupe of new one mostly involves a quality problem
Yes, and Codington Crescent is a quality problem.
12:52 AM
A: Sandbox for Proposed Challenges

a1426Targeted sum and difference of a sequence You are given two things: a target integer(not necessarily positive) n, and a sorted list/array/etc. of non-negative integers a. (The list will have at least two elements). Your goal is to choose one element of a as your total, and then one by one, take e...

3 hours later…
3:36 AM
CMC: Get from Keyhole to Communism in the least amount of clicks
Back button, ctrl-f and disambiguation pages are all allowed
From wikipedia:
Obviously, editing your beginning page to have a link to the destination page is not allowed. Not only does this defeat the point of the race, but it will compromise the integrity of Wikipedia and anger the Wikipedia users.
Generally, the game aims to make use of the consumer version of Wikipedia (i.e. articles in mainspace). This means User pages and Talk pages are generally not allowed.
Using "Navigation", "Interaction", or "Toolbox" links (on left side of website on Desktop browsers) is not allowed.
Correction: User pages and Talk pages are not allowed.
Random article, let's go
Serious answer though, Keyhole -> Keyway Air Transport -> United States Air Force -> United States Army -> Communism
4:11 AM
That's short!
4:44 AM
Navigate to Communism -> Navigate to Keyhole -> press back
Enter "Communism<enter>" in the Search box. 0 clicks.
3 hours later…
7:42 AM
Q: Connect the Three Kingdoms

SisyphusYou are a medieval overlord tasked with designing a road network between three kingdoms placed on a \$9 \times 9\$ grid. A sample placement of kingdoms might look like this: Non-commercial use of tileset by douteigami. Thanks! The kingdoms make the following three demands: The road network must...

3 hours later…
10:13 AM
A: Sandbox for Proposed Challenges

SanchisesStore eight bits on a punched card code-golf binary encode A little while back, data was frequently stored on punched card. A typical card would have 80 columns of 12 possible 'punch' positions. A plethora of encodings was used, each for their own specific purpose. These days we like to think of ...

3 hours later…
1:43 PM
A: Sandbox for Proposed Challenges

caird coinheringaahing\$n\$-perfect numbers A positive integer \$x\$ is an \$n\$-perfect number if \$\sigma(x) = nx\$, where \$\sigma(x)\$ is the divisor sum function. For example, \$120\$ is a \$3\$-perfect number because its divisors sum to \$360 = 3\times120 = 1+2+3+4+5+6+8+10+12+15+20+24+30+40+60+120\$, or \$92607...

1 hour later…
2:44 PM
tio.run/##K8gs@P/fwEEr8f///4YGhlwGhoZchoYG/3XzAA @DLosc bit of a problem on this one
3:23 PM
CMP: What percentage of your answers have 0 net score? This search query should tell you the number of unvoted answers, and this should give all your answers
3:33 PM
for me it's around 14%
@cairdcoinheringaahing 35% :/
26% so far
@cairdcoinheringaahing should just be easier to check profile for all answers
@Razetime Not if the link is already there :P
Personally, I like to see how many answers I have by going through every question and counting which of the answers are mine :P
@cairdcoinheringaahing 5.4%
4:07 PM
@Neil whats the golfiest possible way to repeat a string n times in charcoal
@Razetime Times(string, int) or Times(int, string)
@cairdcoinheringaahing 13.3%
4:30 PM
For other users, am I the only user on this page? I'm not sure if it only shows each user themselves, and if not, it seems weird that I'm the only person who's edited this month
Yes, you are the only one there
That means you are the only one who has done at least 5 edits in September 2020
@Neil how do if statements work?
(if you mouse over the "editors" tag it says "users who edited at least 5 posts")
i've tried if(condition) {stuff} {else stuff}
@pppery Ah, didn't realise it only counted >5. Was very confused that no other user had edited someone else's post :P
4:49 PM
nvm got it
3 hours later…
7:59 PM
> Thinks my 19 byte answer is too long
> looks at other lowest scoring answer at 52 bytes
Joys of golfing with Jelly against Pyth tho :P
1 hour later…
9:16 PM
A: Sandbox for Proposed Challenges

Sumner18Word Length-Sum Multiples A port of my other question: Double Prime Words Consider a word/string of n alphanumeric characters with sum of the characters, s, using their numeric position in the alphabet (a=1, B=2, c=3, etc.) or numeric value (0,1, 2, 3 - 9). Numeric characters should be taken at i...

9:35 PM
Any final feedback on this?
10:29 PM
@cairdcoinheringaahing 16.21%
@Razetime note that succinct if statements always have an else (except at the end of a block), the deverbosifier doesn't take that into account, so if you write if (1) Print("no"); Print(" else"); it just prints no.
Q: 3D Spinning Donut/Torus

MattI recently watched a Youtube video referencing a blogpost that shows how to generate a 3D spinning donut. The code itself is quite short, but I think it would be interesting to see just how little characters are actually required! (Also, looking forward to seeing the "Jelly donut"). For the sake ...

1 hour later…
11:40 PM
A: Sandbox for Proposed Challenges

sporeballsporeball numbers Background We've studied Neil numbers and Bubbler numbers, but what about sporeball numbers? My user ID is \$91030_{10}\$. Its binary representation is \$10110001110010110_2\$, a representation which has an interesting property of its own: The longest palindromic run of binary ...


« first day (3513 days earlier)      last day (1370 days later) »