« first day (4675 days earlier)      last day (467 days later) » 

00:47
huh, even with how active I am in TST I've still sent 2k more messages here
01:00
Sandbox posts last active a week ago: Can I do this parkour?, (untitled), UTF-8 sum of source code.
 
1 hour later…
02:01
CMC: Given a the list of prime factors for two numbers, return the prime factors of their sum.
I'm pretty sure there's no faster way to do this than just prime factorize the sum of a and b's products...
02:28
you could factor out the intersection
 
2 hours later…
04:09
CMC: Is it Daylight Savings?
04:24
Jelly, 0 bytes (code only works in 1907 and before)
Jelly, 0 bytes (code only works in Arizona but not on land owned by the Navajo nation)
 
2 hours later…
06:03
Vyxal, 0 bytes (assumes the interpreter is in Queensland, Western Australia or the Northern Territory in any time >= 2023)
06:20
i was about to say "wow, did y'all just get rid of dst? nice" until i remembered you're in nsw
07:16
:p
 
1 hour later…
08:44
@ATaco 0 bytes, assuming interpreter is running right now and in the northern hemisphere
@mousetail Didn't work for me. :P
Did you test at the exact moment when I posted the message?
@mousetail Does IT support ever provide favourable conditions?
 
1 hour later…
10:17
Sir this is a Wendy's
3
10:49
CMC shortest x with given codegolf.stackexchange.com/questions/138053/(x). Either 1a and ` a` are valid output for input ` a`
 
1 hour later…
12:03
user image
3
we did it
the brainrot of 2020 has corrupted copilot
12:15
I ate like 12 cans of beans today. I bet you're too weak to match my bean eating powers!
@NewPosts weird flex but okay
12:35
@lyxal three years from now it'll say "Red is skibidi"
 
3 hours later…
15:07
CMC Write a program with an ACE vulnerability, shortest wins
exec(input())
Wonder if you could do a real one with ctypes
CMC4real Given raw machine code as a byte string, make your processor physically jump to it
15:24
xjb make your processor physically jump
3
Maybe if you spin the fans fast enough
xjb make your processor physically jump
15:52
0
Q: Golf Transmission

Pacmanboss256As in, the 5 speed transmission from the original VW Golf GTI. Print the transmission pattern in as few bytes as possible. 1 3 5 | | | |--|--| | | | 2 4 R

 
4 hours later…
19:42
CMC: Rencontre numbers. Given n and k, output the number of permutations of [1, 2, 3, ..., n]with exactly k fixed points
I'd post on main, but there's an incredibly trivial answer once you can calculate derangements
In fact, I have 7 bytes in Jelly, same length as the Jelly answer to Compute the Subfactorial
20:15
Ugly brute-force 8 in Vyxal: ɾ:Ṗ$v=ṠO
I don't think vyxal has derangement/subfactorial builtins
If it does, it should be able to do it in around 4 bytes
Maybe 1-2 more due to stack manipulation
If Jelly had subfactorial as a builtin, it'd be 4 bytes. Chaining really helps for it :P
 
2 hours later…
22:29
@mousetail Vyxal 2.6.0, 2 bytes: ∆ė
Gets the derivative of an algebraic expression
@mousetail GolfScript, 1 byte ~
because you can run arbitrary ruby in string literals
22:54
is some variable lookup struct made of both a stack for scoping and a HashMap for finding too complicated for a 2-d-matching language? for Fortnightly Ch. #6.
i haven't read the whole challenge, but that seems like it could be helpful
at least some kind of structure to store previous matches
hashmap feels a tiny bit overkill but it could fit if you did it right
23:10
one of the types only has one-character names so it can go into matrices in the code; would HashMap<char,Generalization> be overkill then?

« first day (4675 days earlier)      last day (467 days later) »