uptime
uptime
Comments
-
@vyas nice one ... re5pekt!
-
hmmm ... it is the year of the Rat, after all :)
-
python3Python 3.6.9 (default, Nov 7 2019, 10:44:02) [GCC 8.3.0] on linuxType "help", "copyright", "credits" or "license" for more information. from math import factorial factorial(42) 1405006117752879898543142606244511569936384000000000 alrighty then!
-
this may be as good a place as any to drop in a secret number <- warning pdf not exactly about commutative combinatorics or suchwhat ... the sha256sum of the secret is 2a75652b3d873e0f89cafb6473c913b4735c0f0e965bb5a7f35d9db79b8b1d50
-
https://youtube.com/watch?v=4xgx4k83zzc
-
@ehab thanks I will take that as a compliment - though I find myself leaning more towards Forth than FORTRAN these days :)
-
EDIT: oy, I just noticed the i in @uhu's nod to Euler, lol -1 Leaving remaining commentary for posterity and lulz :blush: from Proofs Without Words via stackexchange See also: Nice one ... How many digits of the result shall I include? If unspecified (and trivially computable) I might make a general policy to truncate at…
-
We are the LESbians, bro! LET us not get too carried away with this smoking hot steamy double entendre but do take a moment to embrace the Spirit of our inner LESbian nature :heart: something something sisters :heart: with respect Happy Valentine's day!
-
Alrighty then - now for the selection celebrating signup #1000 :smile: The secret was: 4105101558976783721 The concatenated crowdsourced digits hashed to create the seed b1381e45222a382568f38de44c04cff5726622afc35afc0071e4d29e17b7878a And the lucky winner is: https://talk.lowendspirit.com/profile/39/name -> OG @Mr_Tom !…
-
omg that was a lot of digits ... I'm just going to leave these notes here for reference before I crunch them together and hash 'em all up, etc. @elliotc and @quangthang thanks for your additional contributions - these will begin the digits for selection #2000, which might happen in a few months, give or take :) Look for…
-
-
Make your time gentlemen! I think @beagle's 64355 came in just under the wire - almost 6 hours ago - and will end this fantabulous run of rando digery-pokery. I'll need a fresh cup of coffee before I get around to compiling the results and opening the fresh thread for selections #1000 and beyond. That may or may not happen…
-
python -c 'print(0xDEADBEEF)'3735928559
-
and 7 of 9 ...!
-
Yar! And I might add: so far so good, with a :+1: for the dealios and superfine potassium selection. Suffice to say "Pay with Confidence!" and get it while it's hot! :scream: (Now for the burn-in and - most important - how things go after the honeymoon, far far beyond the next few hype cycles, well past the big bang and…
-
that's a good question - it's a bit hit or miss if I happen to have an actual application that gives a service a regular workout, and then it's mainly a matter of time. I do try to stay in "secret shopper" mode as much as possible :)
-
js> parseInt('1' + '1', radix=2)3 ✓ I'll allow it.
-
https://youtube.com/watch?v=dGFXGwHsD_A
-
whoa. @vbloods went up to 11 ... and then just kept going. Well played sir. welcome and congratulations on your first comment @quangthang if you like numbers, here is some food for thought: Who can name the bigger nuimber? translated: La course aux grands nombres ¿Quién puede nombrar el mayor número? (pdf) 谁能给出更大的数？
-
I'm inclined to just parse it as 10, unless you have some other suggestion?
-
@Iroshan464 I see what you did there ... (digits 2 through 7 of the Hofstadter Q-sequence) it's an older meme sir, but it checks out - I'll allow it!
-
oh fur fox sake! :scream:
-
my AZ "dedicated core" deal is still up. Perhaps this was all just a big misunderstanding? EDIT: just ran another geekbench - performance seems to have degraded a bit since fresh install (but I'm running an X server on it now, so maybe that explains it) ... https://browser.geekbench.com/v4/cpu/15221351 not sure whether I…
-
date '+%s'1581486423