« first day (3256 days earlier)      last day (1591 days later) » 

12:44 AM
@flawr It would probably be a bit streched. Anyway I ended up settling for a non-random approach, which is too slow and lengthy for me to post it in its current state
 
 
2 hours later…
2:25 AM
@NewMainPosts That makes me think of making a polyglot that supports all programming languages that have the starting characters from "A" to "N". Any ideas?
 
 
6 hours later…
8:45 AM
Oops, actually it's a 38 byte (not 46) JavaScript ES9 answer competing against a 51 byte JavaScript ES6 answer.
 
 
1 hour later…
9:56 AM
Hah, I didn't think the Silencium hat would be such a good fit for my profile picture
 
 
7 hours later…
4:33 PM
@Mr.Xcoder now your hat has a hat
 
I guess I'll take a screenshot
And use it as a profile picture after winterbash as well, it just looks better than the original
 
 
2 hours later…
6:23 PM
@DJMcMayhem I went over to the emacs side codegolf.stackexchange.com/a/197561
 
6:47 PM
It looks like the decline decreased this year!
 
@flawr How do you get such a nice graph?
 
@Adám I have a script for TNBDE to get the number of messages per week. Then I import the data to matlab, compute a moving average over these numbers and use matlabs semilogy:)
(I iterate over the years to get a new color for each of them)
Is there somethig more specific you wanna know?
 
@KritixiLithos You were the chosen one! You were supposed to bring balance to the editors!
You were supposed to destroy the emacs, not join them!
 
@Adám very nice hat btw :D
 
@DJMcMayhem :P
I am getting accustomed to emacs with vi keybinding (thanks to evil) but evil isn't complete, I have yet to look into other vi packages
 
7:02 PM
@KritixiLithos heretic
 
vim's modal editing is superior, but I've read great things about emacs lisp (vs vimscript, of which I've only heard complaints)
 
ngn
@KritixiLithos you should take photos of your left pinky before and after a using emacs for a while :)
3
 
haha yes, that's why I use evil
but to learn how emacs works, I went over the emacs tutorial
 
7:29 PM
@flawr The same (well, since '17) for the APL Orchard.
@flawr Thanks. I wear a similar one IRL.
 
@Adám I got the data from @El'endiaStarman's TNB data explorer, I'm not sure, can we also access the chat data from the SE website?
I don't exactly know how it works, but the SE data explorer doesn't seem to allow access to the chat data. @El'endiaStarman Did you scrape all the data from the website?
 
@flawr Hm, it should be fairly easy to write a script to fetch the entire transcript, then analyse that.
Although it'd have to make a few thousand requests. Might get banned…
 
I wonder how @El'endiaStarman coped with that. (sorry for the many pings)
 
@flawr Since the transcript rarely changes, just having a job fetch the new parts every day would allow their server to have all the data cached, and not need to fetch for each query.
 
@Adám if just scraping https://chat.stackexchange.com/transcript/52405/y/m/d, it'd be a request for each day something happened.
 
7:45 PM
@dzaima Yes, hence "a few thousand". Although does that url actually give you the whole day on busy days?
 
@Adám it doesn't, but on those days the sidebars timeline has mouseover text for message amount
 
@dzaima OK, so it is pretty simple: for each day's transcript, if there exist .msparea sum the numbers in their title, else count .messages.
 
-1
Q: Determine if a number is less than another

YousernameIntroduction Your job is to write a function or program that detects if a number a is less than a number b. Simple, right? But there's a catch. You are not allowed to use ==, ===, <, >, <=, >=, !, !=, !== or any similar operations in any language. This challenge was inspired by this other chal...

 
8:28 PM
hi all
 
8:48 PM
@Anush is there a shortcut you can take to compute the levenshtein distance for binary strings?
 
-1
Q: Can you calculate the average Levenshtein distance exactly?

AnushThe Levenshtein distance between two strings is the minimum number of single character insertions, deletions, or substitutions to convert one string into the other one. The challenge is to compute the average Levenshtein distance between two independent and uniformly random chosen binary strings...

 
9:07 PM
0
A: Sandbox for Proposed Challenges

YousernameIntroduction Your challenge is to write a code that does...nothing! But there's always a twist. Your code must follow a few rules... Challenge There is no input or output. Rules The code must be at least one character long. Otherwise, it's not even code! It has to be grammatically correct....

 
@flawr Not directly. But lots of pairs well have the same distance and if the distance is small you can compute it more quickly
 
9:27 PM
Hm I get different results from yours
 
9:51 PM
dang, the code I stole from another challenge is not correct D:
 
Phew :)
Actually there might be faster ways of computing the edit distance if binary strings, especially as they are short
 
@Anush Do we have to output the fully reduced fractions? (see comments in challenge)
 
@flawr no, just the exact answer is any easily understandable human readable form is fine
 
great, saves me some bytes:)
oh no, it is not
 
10:18 PM
Sorry!
I was thinking of making a code-golf question from my other edit distance question
 
 
1 hour later…
11:37 PM
@Adám I never got banned though I definitely got super rate-limited when I was churning through the first million or so messages...
@flawr Yep, I scrape this transcript.
 
0
Q: Random triple with uniform marginals

xnorOutput a random triple \$(x,y,z)\$ of real numbers such that \$x+y+z=\frac{3}{2}\$ Each of \$x,y,z\$, taken alone, is uniformly distributed from \$0\$ to \$1\$. Please explain in your answer what distribution your code produces and why it meets these conditions. In particular, please include ...

 

« first day (3256 days earlier)      last day (1591 days later) »