advent-of-code

[stable heron]

oof

[stable shale]

Im gonna do this in the morning when I have the brain capacity to do it

[stable heron]

ima do it rn

[crystal shard]

this seems easy

[signal grotto]

Mark my words I will have a beautiful object-oriented solution to this one too, but tomorrow 🤣

[stable shale]

Hah

[signal grotto]

!remind 19h actually do this 😂

[marsh current]

I'll allow it.

Your reminder will arrive on <t:1638835775:F>!

ID: 3638

[stable heron]

i am doing oop :D

[signal grotto]

I’ve done it the past couple days and I’m pretty happy with it

Nice code is also much easier to get right and also to debug

[stable heron]

yea it looks so neat too

[stable shale]

I've yet to use OOP except for yesterday's bingo

I'm just using horrible logic and for loops

[brazen goblet]

I'm at day 3 part 2 and I'm having some problems with my code, I'm at #help-apple, any help would be greatly appreciated (if anyone is free at the moment)

[woven solar]

I think questions about AoC solutions are supposed to be contained to #advent-of-code-spoilers-archive

[narrow crown]

i wont be doing todays thing rn but how does it look so far

[brazen goblet]

oh i see i thought we can only ask for help in the help channels

[regal garnet]

Looks fun, great profile pic btw

[narrow crown]

thanks lol

[hazy pendant]

ez

[stable heron]

oh no my sol is going sooo slow after 30 days smh smh

[blazing kraken]

!remind 5h Do advent of code day 5 and day 6

[marsh current]

NEGATORY.

Sorry, you can't do that here!

[stable heron]

is it just slow or will it crash my comp

[blazing kraken]

!remind 5h Do advent of code day 5 and day 6

[marsh current]

Nah.

Sorry, you can't do that here!

[blazing kraken]

!remind 5h Do advent of code day 5 and day 6

[marsh current]

Not likely.

Sorry, you can't do that here!

[blazing kraken]

what

[hazy pendant]

#bot-commands

[sinful pawn]

it didn't work the first time, it's not gonna work the second or third time

[deep ferry]

im racing my friend

lol

[blazing kraken]

computing day 5 takes 2hours

lamo

[stable heron]

Hmmm I'm done with part one

part two 😩

[somber crow]

^

[bold needle]

map's faster or recursion?

[dense solstice]

Took me longer to compute the result then it took for me to write the solution

kek

[somber crow]

Mine has been computing for 25 mins and counting

[stable heron]

thats probably not the correct way to do it then

if its taking > 15secs

[wet current]

Something is wrong then. Everyday till current should be done in milliseconds.

[dense solstice]

You should probably take a quick look at your code

Doesn't sound right

[somber crow]

I looked at my code and tried to change some things and I have both versions running, we could talk more in #advent-of-code-spoilers-archive

[hazy pendant]

try to ||view the problem in a different prespective||

[woven oriole]

try to make a general form 😩

[brazen goblet]

#help-bread if anyone's free, I'm on day 3 part 2

[jade root]

AAAAAAA part 2

part 2 hard ;n;

[stable heron]

yes goddamit

i can reach till 150

in okayish time

[jade root]

i am currently on 231 with the test input

practically frozen

[frank maple]

i liked this one

the runtime stuff is fun

[summer kraken]

My computer crashed in the second part..

[jade root]

same

[frank maple]

that happened to me in 2019 aoc

[jade root]

guys, can i get a lil hint? .w.

[frank maple]

i interrupted when i saw it was looong

[woven sable]

ok so after listening to music for this: all too well is some great background music

you don't notice it, it just plays in the background

[hollow wharf]

use a ||dictionary||, with || lists on p2 you'd need terabytes of ram ||

[jade root]

ohh

[violet raft]

i dont get what the second part's asking

[tight dune]

my ram spiked to 7 gb usage and almost crashed my pc

[violet raft]

isn't the second part same thing as first, but different day number?

[tight dune]

it is

[violet raft]

oh, that's kind of dumb then

[tight dune]

not really

[frank maple]

get ready with yer keyboard interrupt

[tight dune]

if you do it like most of us did you will hit your resource limits very fast

[peak dock]

yes, but the naive approach that works for part 1 doesn't for part 2

[summer kraken]

not really.. first part runs fine. second part will blow up your computer.

[frank maple]

huehuehuehue

[violet raft]

hmm, i see

[frank maple]

i thought the same thing tho i was like wtf

[pearl needle]

the second part is a trap for those who did the first problem inefficiently/naively

[summer kraken]

And I fell in it.

[tight dune]

me 2

i waited for 20 minutes

waste of time smh

[summer kraken]

I literally solved first part in 10 minutes and wasted 40 minutes in the second one.

[tight dune]

me 2

[simple bison]

yeah...

6 00:02:52 63 38 00:43:12 5206 0

[old basin]

I looked at AoC a bit, does user have any control over which challenges are presented, or do you just take what they give you?

[peak dock]

the latter

[old basin]

ok thanks

[hollow wharf]

course there are 5 years of old challenges, 50 per year, so you can take your pick

[old basin]

is it possible to search for certain kinds of things? for example suppose I want to see only problems involving nested FOR loops

would i be better off looking at another resource?

[dense solstice]

Probably leetcode

[hollow wharf]

Also CodeWars. You can filter by specific things - e.g. easyish Python challenges involving loops: https://www.codewars.com/kata/search/my-languages?beta=false&order_by=popularity+desc&q=&r[]=-8&r[]=-7&r[]=-6&tags=Loops

[old basin]

that search string returned 0 results but it's probably just a little string problem, I get the idea, that's excellent thnks!

[woven sable]

Oops

I did an O(n^2) solution for the first one

no even worse

I had to use ||dicts|| for the second part

[pearl needle]

it's exponential growth

[woven sable]

so would it be O(2^n)?

wai tthat doesn't make sense

[pearl needle]

yeah, something like that

1 fish becomes 2 fish in x days. 2 fish become 4 fish, 4 fish become 8, etc

unless you did some other kind of algo

an algo that ||simulates each individual fish every iteration|| will be exponential

if you came up with an O(n^2) solution, part 2 shouldn't be that much slower than part 1

[old basin]

wow leetcode also looks useful thanks @dense solstice

[dense solstice]

👍

[hollow wharf]

lmfao I was confused as hell as to why I kept getting answers that were too high. turns out I was getting the number of fish at 265 days instead of 256 days

welcome to clown town

population: me

[stable heron]

LMFAO

[hollow wharf]

anyway solved it now

although my friend is doing them faster than I am, and he's doing them in x86_64 assembly so I can't feel too good about myself

[hazy pendant]

lmao

typos\™

[hollow wharf]

anyway I got a good enough algorithm. it's probably O(nlogn)

I think

[devout tusk]

lmao

[hollow wharf]

It runs fast enough that time can't measure it so I'm very happy!

❯ time ./Day6
372984
1681503251694
Day6  0.00s user 0.01s system 48% cpu 0.018 total
```:D

[hazy pendant]

ooo

https://youtu.be/LSgk7ctw1HY

the fish:

[devout tusk]

yep, mine took 0.0017s

[hollow wharf]

nice!

which language?

[devout tusk]

python lol

[devout tusk]

what about you?

[hollow wharf]

Haskell

[devout tusk]

ohh damn. I learned it a bit but it's functional nature is like none other. Takes hella time to perfect

[hollow wharf]

yeah, that's why I'm using it for AoC

trying to learn

[tacit marsh]

hello

[ember cargo]

Bro

I've been waiting 30 mins to compute part 2

[hollow wharf]

you'll likely need a new strategy

[eternal forge]

^ this 😄

Same position here hence || using lists i assume ||

[ember cargo]

Yeah

Whoops wrong channel sorry

[iron reef]

The fish shouldn't be nlogn pretty sure

Everything except the number of days should scale to irrelevance and it should come out to O(n) where n is days

[hollow wharf]

general rule is that if it doesn't finish in 15 seconds it won't finish before the heat death of the universe

also my solution for today is only 25 SLOC!

[iron reef]

oh if we're golfing python we can absolutely get this to a one liner

[hollow wharf]

sorry, it's 25 SLOC and semantic lol

if I wanted I could make this a one-liner too

[wary veldt]

helo guys me noob how do i solve aoc?

[hollow wharf]

I really don't understand day 3: part 1, can someone explain it?

[next oyster]

You got to find out which board wins bingo first according to the keys in order (at the top of the input file) and then score the board that wins

[winter vigil]

ok dumb question, but for day 6, how are they getting 26 for the total lantern fish?

in the sample output

[cold ferry]

run the simulation for 18 days, then count how many fish there are

[hollow wharf]

as in, there are 26 numbers in the After 18 days: 6,0,6,4,5,6,0,1,1,2,6,0,1,1,1,2,2,3,3,4,6,7,8,8,8,8 list

[winter vigil]

oof me, i was tallying only the new fish being born

sometimes i need to read

lol part 2 is a huge trap

[iron reef]

i just changed one number to get part 2

what's the trap

[winter vigil]

my code is terribly optimized

i changed one number too

but its taking forever lol

[iron reef]

it should be an O(n) operation

[hollow wharf]

Please

[winter vigil]

and n = # days elapsed

right?

[iron reef]

yeah

[winter vigil]

ok

[iron reef]

All other variables become irrelevant rapidly

[winter vigil]

oh i see

no wonder its soo slow lol, cuz the list is growing dynamically

[iron reef]

list shouldn't be growing

[cold ferry]

you probably shouldn't have a list that's growing...

the list will get too big for that

[winter vigil]

yes

part 2 made me realize that big time

my part 1 computed relatively quickly

[peak dock]

yeah, you'll have to change your approach for part 2 if you don't have terabytes of ram lying around

[winter vigil]

yea true

pycharm's memory usage was certainly spiking

think i left the script running for 5 minutes lol

[hollow wharf]

Today is cool

Forces people to take a different approach

[modern oracle]

Welp, there goes my plan

[eternal forge]

For || "best case" I should only loop once over the days and nothing more? ||

[woven oriole]

haha knew someone would post this

[dusk cove]

192M lanternfish til now, still waiting...

[iron reef]

It's a trivial operation per day

[hollow wharf]

LMAO

[hollow wharf]

It will take long

It's exponential so yeah

Good luck

See you in a few days

[dusk cove]

yakho kifach

[hollow wharf]

I got 1'644'286'074'024 as result so you can do the maths

[void ocean]

see you until the heat death of the universe

[hollow wharf]

[hollow wharf]

No need to wait here

[iron reef]

Well I just need to hope everyone above me on the leaderboard also has these troubles with this problem

I literally can't make 1st place unless there's multiple days of people above me not being able to solve some days

Too many days of only being able to start hours after the reset time

[winter vigil]

what is the key behind part 2?

i don't really understand how to optimize it

am i supposed to compute some kind of exponential function?

[hollow wharf]

nah, you want to ||use dictionaries where the keys are the fish stage numbers and the values are the amounts of fish at that stage||

though there are other approaches, but that's probably the simplest

[winter vigil]

lol

i see

ofc i gotta use hashmaps

[ember cargo]

Welp you can join a local leaderboard with friends

[winter vigil]

these lantern fish should be exterminated

[mossy basin]

i think the list approach is simpler, doesn't require moving the numbers around each iteration

[ember cargo]

||With .pop() etc?||

[winter vigil]

wouldn't that choke up your memory?

[mossy basin]

not the brute force method, a different list approach

[winter vigil]

ah gotcha

[blazing kraken]

Python is too slow, I does not compute day 6 part 2 for some reason

Anyway i can optomise it?

[hollow wharf]

easier to code once you understand, I agree, but I find that way trickier to understand at first

[ember cargo]

||Not a list of each individual fish, but a list of [0, 0, 0, 0, 0, 0, 0, 0, 0] for the number of fish at each stage|| click that if you want the explanation

[ember cargo]

Yeah I was using brute force before, after about an hour my loop got up to day 211

But it would've taken months to get to 256

[hollow wharf]

see the last ~15 or so messages, we're discussing just that

[winter vigil]

what was the length of the list?

if you kept track of it

[ember cargo]

😅 a very big number, lemme see

[winter vigil]

its in the billions fs

[ember cargo]

Day 100: 2180834

Day 125: 19062620

And this is my old method btw, parsing every single elem in that list with if statements

[hollow wharf]

For part 2 my len is

[blazing kraken]

i used pypy

but no luck

[hollow wharf]

1644286074024

[blazing kraken]

what can i do?

[ember cargo]

You gotta optimise it

[blazing kraken]

it kills the process right at 170

[ember cargo]

Yeah same

[blazing kraken]

what

[iron reef]

python isn't too slow to do this

[peak dock]

youll have to change your approach altogether

[ember cargo]

What you gotta do is ||make a list storing how many fish are at each stage instead of storing each individual fish||

[blazing kraken]

oh that idea will work

lemme try that

[ember cargo]

So something like ||fish = [0, 0, 0, 0, 0, 0, 0, 0, 0] and then every day you'd move the fish from fish[5] to fish[4] etc||

||If they're in fish[0] you'd just deduct that from fish[0] and add it to fish[8] and fish[6]||

[blazing kraken]

what

[ember cargo]

Check #advent-of-code-spoilers-archive

[iron reef]

My solution for number of fish on day 99999 is https://paste.pythondiscord.com/qigonamace.yaml

well that looked smaller in my program output

[peak dock]

uhhhh

could you sent that in a pastebin lol

[modern oracle]

Mine is https://paste.pythondiscord.com/umutasunip.py

[iron reef]

is there a discord shrink output tag

ok figured it out

[peak dock]

can i see my overall global rank somewhere

there's a personal stats thing but it shows day-wise

[pale heath]

my code for part 2 of 6 is kinda slow

[void ocean]

"kinda"

[pale heath]

lets say very

[eternal forge]

That was a lot smarter, thanks 😄

[rancid creek]

don't forget to fill out the AOC survey: https://t.co/hdp7AKLhfx

It says unofficial, but I got the link from Eric, so....

[void ocean]

complexity of simulating the fish is O(2^(d/7)) where d is days

I forgot if the fractional exponent is simplified in big-O

probably is

[pale heath]

I did it in simpler way

(not saying better)

||I just change range from 80 to 256||

[hollow wharf]

today was diiiiiirty

[hollow wharf]

yeah

.aoc join

I wonder

.aoc link Akarys42

[hidden copper]

Akarys42 is already tied to another account. Please contact an admin if you believe this is an error.

[hollow wharf]

well, yes and also no

[void ocean]

nah

it's not proportional by a constant

[hollow wharf]

you should remove the constant I believe

[void ocean]

it's not proportional by a constant though

it's root 8 of 2^n

[hollow wharf]

it is O(2^(C*n)) where C = 1/7, C should be removed so you get O(2^n), right?

[proud cosmos]

2^(n/7) = 2^(1/7*n) = (2^1/7)^(n) in O(2^n)?

Not sure if you can remove it

You'd need no seperate the 1/7 from n entirely but that seems unlikely now that I remembered how the rules work

[hollow wharf]

2^(2n) is equivalent to 2^n in Big-O, right?

[proud cosmos]

Yeah that should be the case

I think.

Might just be 4^n though

Ah nope it isn't equal

Cause you can't remove the 2 from the n so you can't find a constant to make up for it so you can't remove it

[woven solar]

but log_b(n) is the same big-O regardless of b

[woven solar]

I see people sometimes insist on saying, say, O(log2(n)) - that's silly, the logarithms are all equal

[proud cosmos]

Yeah cause you can replace them all with ln divided by a constant

Making it equivalent

[woven solar]

yup

[hollow wharf]

that I know

alright, interesting

how fast can you compute 999,999 days?

mine can do in 2.09 mins with a tooooon of logging

[proud cosmos]

1e6 took me 6 seconds I believe

No logging though

Logging should slow it down a lot

[woven solar]

1s for 1 million days for mine

[void ocean]

O(C*f(n)) is in the set O(f(n))

You can't express 2^(n/8) as C*(2^n)

[hollow wharf]

Right, makes sense

I'll try without logging during the English class hehe

[loud yew]

people are using big-O notation, something horrifying must be happening

[hollow wharf]

Hahaha

[loud yew]

anyway, i decided to use a deque and tqdm, and (so far) it is fairly performant...

[eternal forge]

First solution was || looping over each number with another loop inside with each day , yikes on me ||

[loud yew]

oh haha my part one solution finished in under a second

[quaint hare]

the pattern is making a lot more sense now

[devout tusk]

for now it looks like a dude peeing on an ascent to me

[quaint hare]

oh god

[dusk ibex]

just finished day 6!

:D

[hollow wharf]

I wonder if we moved up into the leaderboard yet

.aoc lb

[hidden copper]

:x: Please use #aoc-bot-commands for aoc commands instead.

[hollow wharf]

thanks

[sleek cave]

today's aoc seems simple enough, or maybe appearances are deceiving

[hollow wharf]

yay we did

[hollow wharf]

are you on part two yet

[sleek cave]

just woke up lmao

guess part 2 escalates like day 3

[hollow wharf]

part two is ||really really similar|| (minor spoil)

[dusk ibex]

yeah for me it wasn't because I used a list for the first one

and appending and stuff

[hollow wharf]

WOW

[bright spindle]

26 seconds for a million days

[hollow wharf]

2.8s for one million days

[dusk ibex]

it was slow as hell in the 2cnd one

[hollow wharf]

2 minutes with printing

that's craaaaazy

[bright spindle]

What technique/language?

[hollow wharf]

Python, using a list

I'll send my code in the spoiler chat

[woven oriole]

wat

how did you manage it not grow exponentially

[hollow wharf]

#advent-of-code-spoilers-archive

[dusk ibex]

mine took 02.200580 seconds

in python

i used a dictonary

[frosty bronze]

Who keeps pinging me

[bright spindle]

Probably the bot?

If you're subscribed.

[digital ember]

Ok i need some help testing my helper adn getting some opinoins, i added a rustlings like watch feature so you don't need to do anything once you start your puzzle

https://github.com/Shivansh-007/aoc-py/tree/feat/test-input

see 2021/02/solution.py

i need to edit the template though

once you get your puzzle by python -m aoc start -d {n}

just do python -m 2021.{n}.solution

and you will get into the watch shell

also it would be better if you test it on an alt if you already attempted all the problems

since there is no good support for already attempted yet

[frosty bronze]

Ohh right I am subscribed but I thought there was an announcements channel separate from this channel?

[signal grotto]

There is, but these messages are sent in this channel

[frosty bronze]

Ah gotcha

[torpid karma]

Well day 6 finaly made my code not run instantly, kind of think that i might need to revise or it will never finish

wow i using the 5 number example and it has been over 4 min

lol 14 min

[dusk cove]

wondering what it will be with the given input

[wispy burrow]

nice!

[torpid karma]

Im going to revise becouse im not waiting that long

[fluid zealot]

damn it took me a while to just understand that part 2 of the day 3

it was so confusing, glad there was an example

[humble copper]

are we meant to assume that the puzzle input for day 6 pt 1 is the first "day"?

[sonic silo]

the first day, yes

just like in the sample

[rotund rapids]

No, you have your puzzle input just like any other day

[humble copper]

damn that was quick

[tight dune]

nice!

[hollow wharf]

Took me 14 minutes to do both parts today

short and sweet

[humble copper]

way easier than yesterdays

[hollow wharf]

yesterday was pretty easy too

took ak like 8 minutes

he made some.. interesting functions

def interval(a: int, b: int) -> range:
    return range(min(a, b), max(a, b) + 1)

def drange(a: int, b: int) -> range:
    if a < b:
        return range(a, b + 1)
    return range(a, b - 1, -1)```

we can probably simplify it

[pale heath]

I love how part 1 is so easy and part 2 is also so easy but then you realise you are missing 16TB of RAM and 15 years

to solve it

[tropic forge]

I've been programming in JavaScript for a week and I almost forgot how beautiful does Python's syntax look

[woven oriole]

🌟 typehint 🌟

lol

[pale heath]

Day 256

[woven oriole]

https://preview.redd.it/r2x1n5n6zv381.gif?format=mp4&s=298d005dc316e460563e3bbf52c150d22a501eb2

nice visualization of growth

[brittle mauve]

I gotta catch up on advent of code

I skipped 3 but i gotta do 4, 5, and 6

[quaint hare]

it looks like a virus colony

[woven oriole]

yeah lol

[hollow wharf]

guys how to settle it

[bright spindle]

This channel is for discussion of the Advent of Code event. If you need help with bot development, head to #discord-bots.

[hollow wharf]

noted thx

[tight dune]

lmfao

[hollow wharf]

Haha

[steep shard]

does anyone know a good online python ide thing

the one im using doesnt give me enough resources to do todays challenge

[velvet stag]

like ram?

[steep shard]

idk it just times out before its done

[hidden musk]

you should try to find a more efficient method

[unique osprey]

My solution that ||simulated every fish|| was on track to take a few hours to complete

[hidden musk]

the number of fish grows exponentially, the answer is on the order of trillions

[steep shard]

hmm

okay

[unique osprey]

probably more

[steep shard]

1-80 took less than a second to compute

[unique osprey]

yup

[minor cave]

there's even a warning 😔

[steep shard]

hm

okay

thx

[hidden musk]

it's fairly easy to convince yourself of that

[bright spindle]

||Someone computed that if you want to create a list of all the fish for day 256, you would need 11 terabytes of RAM||

[dusk cove]

4kb of RAM back: I can go to the moon
10Tb of RAM today: damn too much fish for me

[peak dock]

lmao

[loud yew]

LOL

[bright spindle]

When the dolphins escaped Earth, they were like "So long and that's too much fish, cool it with all the fish, alright?"

[steep shard]

time to buy a 16 terrabyte hard drive and make a 12 terrabyte swap file

[low condor]

Just finished Day 6

I love the Part 2 solutions that are like "do what you did a few more times"

But only if I get the trick

[woven oriole]

i just came up with recursion out of nowhere

||the idea of fibonacci||

lol i didn't think that would even work but recursion is epic sorcery if you break down each function call and what is happening

[minor cave]

spoiler this sentence please~

[woven oriole]

oop

[ember cargo]

Oreo can you send me your code I wanna see it

[woven oriole]

F

[minor cave]

thank you~

[woven oriole]

i was mistaken , i though it was spoiler channel 🥴

[steady rune]

||they really said "solve the collatz conjecture" :trol:||
(may be misinterpreting the mission)

[woven oriole]

you can look for hints plus the solutions are also updated regularly on github and our aoc subreddit 😄 if you are stuck

[ember cargo]

I've done it ||with a list of how many at each stage||

I'm just curious how you'd do it with ||recursion||

[woven oriole]

shall we first shift to #advent-of-code-spoilers-archive

[ember cargo]

Kk

[steep shard]

idk why u guys focusing on this so much just make a 12 terrabyte swap file 🙄

[bright spindle]

||My solution requires 250 kb for 1 million days, imagine what I could do with 12 terabyte||

[woven oriole]

logic is inversely proportional to size

🌟

[bright spindle]

What do you mean by "logic"?

[woven oriole]

cleverness

i mean better logic

lol

[bright spindle]

And "size"?

Memory usage?

[woven oriole]

yes

or

runtime

:P

[bright spindle]

Well, there's usually a tradeoff between memory and time, so a really clever solution can either be optimized for speed or minimal memory footprint.

[woven oriole]

exactly

but i would take runtime as the priority

since the tradeoff is not too subtle

[steep shard]

i hate online ides

i had the solution

and then the web page broke

and now i have to restart

[robust heart]

So the step would be... find a link between the initial step, number of days and the population?

[unique osprey]

Why you using one?

and don't most of them have a save function?

[steep shard]

im using an online ide because im on my school chrome book rn

i cant download python on it

[unique osprey]

gotcha

[steep shard]

and i thought this one does but ig not

[gleaming token]

what online ide are you using?

[unique osprey]

you should be able to install python on a chromebook though

unless it's locked everything down

[steep shard]

yea they locked down everything

[uneven hollow]

how long did it take to run part two of day 6

[unique osprey]

3ms for me

[uneven hollow]

mine's been going on for a while

[uneven hollow]

milliseconds?

[unique osprey]

yeah

[steep shard]

online-python.com

[unique osprey]

you need a different solution

[steep shard]

u need to use a more efficient method

[uneven hollow]

so you didn't brute force it

ah

ok

[unique osprey]

i did for part1 😄

[steep shard]

brute forcing it would need 12 terrabytes of ram lol

[uneven hollow]

ok

let me check

hmmmm

[unique osprey]

Terrabyte: noun, the amount of memory to store the entire Earth

(sorry, just being facetious with your spelling 😄 )

[unique osprey]

Let me know if you want a hint. i think i can give one without spoiling the whole solution

[uneven hollow]

ill spend a bit on it thank you

[pale heath]

3 seconds

[gleaming token]

.09s for both parts

[robust heart]

haha shit

I think my memory exploded

[steep shard]

yay i did it even though my solution was super stupid lol

[steep shard]

wat

[robust heart]

No more ram I did some naive solution where the list kept expanding

Man i really need optimization but I can't see how

[loud yew]

terrabyte lol

[steep shard]

theres lots of different ways to optimize it

i can give u a hint if u want

[robust heart]

I think I've figured out the start if I consider the initial timer value and the number of days in total. Just need to see how I can organise that bottom-up approach.

[marble minnow]

hows the score calculated

on aoc lb

[minor cave]

The same method as private leaderboards, it's just that we combine 7 of them before we re-rank and re-score

[proud cosmos]

Still wonder how they decide which is first between the 7 leaderboards

Does the website give back the timestamp of completion?

[minor cave]

The website gives us completion time, we rank based on that

[earnest forge]

Yes, there's a JSON API

[proud cosmos]

That makes it easy then

[minor cave]

yup!

[proud cosmos]

Was wondering how you can possibly know who is faster

[minor cave]

It's also how we're able to do our .aoc daystar command

[marble minnow]

@minor cave are you a person working on aoc?

[earnest forge]

PyDis private leaderboard JSON API: https://adventofcode.com/2021/leaderboard/private/view/631135.json

[proud cosmos]

Damn

[earnest forge]

Other leaderboards can be found by changing the number at the end

(there's also just a button to get this link on the private leaderboard)

[minor cave]

I run the Advent of Code event for this community specifically (i.e., I make sure we have all our leaderboards and bot features are up to date). That sometimes requires me to interface with the actual AoC organizers, but I'm not an AoC organizer myself

[marble minnow]

good to know :)

wondering who Oliver Ni is

[proud cosmos]

A person that is fast

[proud cosmos]

Nice!

[marble minnow]

gj

[junior hinge]

i really hope part 2 is okay cause my head is on vacation today

[proud cosmos]

It'll work out

[marble minnow]

it might work and also take 10 hours to calc

[junior hinge]

hehe 😄

[marble minnow]

i had this problem

[robust heart]

you need a solid ram if you wanna apply the good old method

[proud cosmos]

solid

[minor cave]

||Several terabytes apparently||

[junior hinge]

rofl

my pc is making sounds i havent heard before

[robust heart]

||y-yeah good thing I interruped the process||

[marble minnow]

idk, my code wasnt using ram at all

just around 9% CPU

[junior hinge]

im guessing theres a way to do this with math?

[robust heart]

||i decided to store the result in an over-expanding list otl||

[junior hinge]

i stopped my code from running. im sure my pc is happy for that

[marble minnow]

most of the people are using some numpy power matrix thingy

[junior hinge]

mkay ;O numpy is fast right?

[steep shard]

u dont need to use numpy

[minor cave]

depends on what you're doing with it

[mossy basin]

i don't think most people are doing it with ||linear operators||

[minor cave]

even though that's technically a spoiler, the solution is so big-brained I don't know if I would consider it a real spoiler

[steep shard]

wait the solution is suposed to be big brained

my solution was so stupid

[marble minnow]

whats this?

[minor cave]

the solution most definitely doesn't have to be big brained, but one of the solutions definitely is. I'll ping you with it in the spoilers channel

[mossy basin]

there's some explanations of it in the spoilers channel if you search a bit

[junior hinge]

i ended up using a ||defaultdict for part1|| is that bad?

[steep shard]

oo

[mossy basin]

nope, that's perfectly reasonable

[junior hinge]

cool, ||i learned about defaultdict and namedtuple in yesterdays challenge 🙂 first time using it in Python||

so what do i do for part2 then? go eat some food while my pc goes into mountain climbing?

[steep shard]

noe

[minor cave]

my solution only took about ~10 seconds (when I upped the days to 1e6) to run for pt2 using a similar approach to yours (if I understood your approach correctly)

[steep shard]

unless u make a 12 terrabyte swap file ur pc will run out of memory before its done

[unkempt cargo]

O.o

[steep shard]

u need 2 be efficient

[junior hinge]

well basically i have a ||defaultdict with each day containing a list of the fishes||

[hollow wharf]

You can make it simpler than that

[junior hinge]

with math? 🙂

[hollow wharf]

No

In fact I don’t think that the math approach yields a very good solution here (personally)

[junior hinge]

🤔

[steep shard]

i cant get the second part of day 5 doen

day 5 is way harder then todays

[hollow wharf]

Weekend problems are usually more involved

[junior hinge]

are you having problems with adding all the diagonal lines?

[low condor]

cough cough sea monster cough cough

[steep shard]

i have everything correct except for 1 line

every single diagonal is fine but 1

[hollow wharf]

Actually the funny thing about the math approach is that ||assuming that you have the eigenvalues|| you could theoretically compute today’s by hand

[steep shard]

0  1 . 1 . . . . 1 1 . 
1  . 1 1 1 . . . 2 . . 
2  . . 2 . 1 . 1 1 . . 
3  . . . 1 . 2 . 1 . . 
4  . 1 1 2 3 1 2 2 1 1 
5  . . . 1 . 2 . . . . 
6  . . 1 . . . 2 . . . 
7  . 1 . . . . . 2 . . 
8  1 . . . . . . . 2 . 
9  2 2 2 1 1 1 . . . . 

i keep getting a graph that looks like this with the example input

[woven solar]

the eigenvalues and eigenvectors are all complex

[hollow wharf]

Yeah

[woven solar]

also really bad, 9th degree polynomial roots

[hollow wharf]

Yep that’s why I don’t like the mathy solution

[sonic silo]

quite a shame

today's puzzle was surprisingly profound

[junior hinge]

i wish i knew how to tackle this days part 2. im tempted to open the spoilers channel soon

[low condor]

You should fish for some more hints before going straight into spoilers

[junior hinge]

im basically holding my fishing rod here, i need a big fish to bite on it with some juicy hint

[low condor]

how are you doing it at the moment btw?

[junior hinge]

i have a defaultdict that has each day as a key. it holds the fishes in a list

[low condor]

Is the list basically just how the input looks like at the moment?

[hollow wharf]

Wait yeah what do the lists look like

[junior hinge]

yup

[low condor]

OK, so let me try a hint then

[junior hinge]

lantern_fish[18]
[6, 0, 6, 4, 5, 6, 0, 1, 1, 2, 6, 0, 1, 1, 1, 2, 2, 3, 3, 4, 6, 7, 8, 8, 8, 8]

[low condor]

||Typically you use a list for ordered data. Is the order of the data here important? If not, can you transform the data some other way instead?||

[junior hinge]

||tuples?||

or ||sets?||

[low condor]

||Tuples don't really solve your problem here. If you are going to use it as a list, then it's basically equivalent to a list in its advantages and drawbacks||

[junior hinge]

||i could use a dict containing the amount of fishes that has that value?||

[low condor]

||What would a set do for you? A set removes all duplicates - is that something that would be useful or not?||

[hollow wharf]

YOOOOOOOO

[low condor]

I was going to be a bit more subtle than that lol

[junior hinge]

||yeah i even know that :D||

okay i think i got it

[hollow wharf]

I don’t do subtlety sorry

[low condor]

yeah I could tell!

[junior hinge]

when my fishes start telling stories 😄

good thing i love fishes. i do love them as food on my plate tho, not in my code editor

[hollow wharf]

D: fish are friends not food

[marble minnow]

I hope that someday AOC will be better for european timezone

[low condor]

Often, when part 2 is just part 1 but with more runs/bigger input/etc. there's a few techniques to think about

• Find the trick that means you don't need to do eleventy billion runs
  or
• Find the data structure that would allow you to have a faster solution

[hollow wharf]

I mean, it’s really fine assuming that you’re not trying to lb

[low condor]

I feel your pain

[tiny vigil]

hello can someone reccomend me a library which will help me make a screensaver?

[marble minnow]

i would like to try it someday

[hollow wharf]

Lol elsewhere

[hollow wharf]

Not the channel for that

[marble minnow]

cuz it takes me 5 minutes for part 1

usually

[sonic silo]

im just tryna wake up at 6 am just to get stuck for 30 mins sometimes

[tiny vigil]

on which chanell i can ask??

[hollow wharf]

I’m on the west coast so they open at 9 PM for me 😁

I finish them before bed

[tiny vigil]

on which channel i can ask about that?

[sonic silo]

youre lucky :c

[hollow wharf]

Beats me

[livid pendant]

I wanted to make the bot delete a message with a specific text, but if someone had a specific permission, it would not delete the message. How would I do this?

[marble minnow]

for me its six in the morning

[hollow wharf]

🙃

[hollow wharf]

#discord-bots or something man

[livid pendant]

ah

sorry

wrong chat

[hollow wharf]

Actually try #❓｜how-to-get-help

[tiny vigil]

thx

[sonic silo]

thing is

the problem aint really whether i need to wake up early or stay up late

the bigger problem is college

luckily i can finish most puzzles under an hour, but

[hollow wharf]

Mood. Finals coming up for you too?

[sonic silo]

say, if something akin to y2020d20 happened, i could take more than just an hour which would mean i wouldnt be able to finish ti

altho maybe by then i wont even have to go

[sonic silo]

Kind Of

[hollow wharf]

Today was last day of classes for me. I have a lab report due tomorrow and then finals

[sonic silo]

finals are next month, but there's a lot of assignments to do until the end of classes for this month

[hollow wharf]

Oh man finals in January :/

All my finals are before Christmas

We start the new term in January

[sonic silo]

i wish the finals were at least early january

[hollow wharf]

Where are you studying? US?

[sonic silo]

the equivalent to computer science in europe lol

leading towards a data science-y branch

[hollow wharf]

Ah gotcha

Whenever I hear college I assume it’s American

I’m studying physics in Canada :)

[sonic silo]

neat

[restive imp]

Yes, I solved todays part 2 🙂
Kind of surprised I got it so quick though

[craggy wraith]

todays one seemed easier than yesterdays

[restive imp]

yeah even part 2 seemed easy at first, but when my code didn't stopp running after 1 minute, i figured it was more complex xD

[craggy wraith]

im still waiting for it to finish running

[low condor]

Never take the whole "do the same thing a bunch more times/with a bigger input" at face value lol

[craggy wraith]

i hope i dont have to change the code

[low condor]

It almost always means that, if you are doing the naive thing, you'll be in for a world of hurt

[low condor]

It's deliberately worded so you have to change the code lol

That's the point

To make you think about how you could do this in a non-naive way

Find the trick or find the more efficient solution - either of the two

[junior hinge]

i know how to do it now, im just so god damn tired. i might continue tommorow with fresh energy

gonna be the first day im not submitting both parts on the actual day. struggle of working in a kindergarden

[restive imp]

I wonder at which point I'm not going to be able so solve it anymore
Last year Day 10 Part 2 made me give up

[steep shard]

never give up

just kuz 1 day is hard for u doesnt mean the rest will be

[restive imp]

I will keep trying this year. Last year I started too late. I think it was a week before christmas

[dusk cove]

old me: oh the part 2 is easy, I'll just change the number of iterations from 80 to 256
PC: please don't

[craggy wraith]

i added an iteration count so i can watch as the iterations get slower and slower

[minor cave]

I let it get to 200 before I killed the process out of sympathy

[craggy wraith]

i just realised i was using the test case

not the real one

[loud yew]

i did this exact thing when i was making a video encoding thing

and it got SLOW

[low condor]

RIP

I went to 150 before I euthanised it

[devout tusk]

https://www.youtube.com/watch?v=CFWuwNDOnIo&ab_channel=CodingTech
interesting....

[craggy wraith]

  ERROR: Failed building wheel for numpy
Failed to build numpy
ERROR: Could not build wheels for numpy, which is required to install pyproject.toml-based projects

rip

[sleek cave]

part 1: lmao so easy
part 2: naive input change? lmao so ea- oh fk wait a minute this is exponential growth and my shitty algo can't stand it

[steep shard]

U don't need numpy to do the challenge

[hollow wharf]

Whenever part 2 is just an increase in one number, that’s almost always the issue

[sleek cave]

yeah, i'm trying to see if i can use math to solve this instead

[hollow wharf]

The answer to that is “kind of”

[sharp panther]

One day I should sit down and do day 1 part 1 by hand.

I wonder how much my hand'd hurt

[sleek cave]

2000 inputs, good luck

[sharp panther]

exactly

it'll be fun!

[unique osprey]

You can do it with ||ctrl-F and regex search||

oh wait, was thinking of day3

nvm

[bleak sable]

this one would be easy

[robust heart]

Day6 p2 is such a pain lol

I’m trying to find the correct remainder for the days but

I can’t organize that in a recursive way

[low condor]

how do you mean, the correct "remainder"?

what remainder is that

[robust heart]

Fishes don’t start spawning until a certain amount of days. Which would be 8 + initial timer

So my idea is, everytime a fish spawns, I’d pick up the day it spawns, substract it to the total days (like 256), estimate the number of fishes it can spawn in that period then add it to the total

[low condor]

Are you ok with light hints, or do you want zero hints completely?

[robust heart]

A hint please

[low condor]

Hint - you're overthinking it

[devout tusk]

true about life as well 🙂

[robust heart]

Should I use a top-down approach?

[low condor]

Still overthinking it

Try have a think about it for 5-10 mins, but try not to overthink it

if you are still stuck I'll give another hint 🙂

[robust heart]

I’m using GoodNotes on iPad to lay down the issue but I can’t really copy the page like that to show my thought process

[low condor]

screenshot? I don't use iOS so idk

[robust heart]

Here goes

[low condor]

^ 🙂

Want another hint?

[robust heart]

Yes please because the only idea I have rn is doing some 2 power of n

[low condor]

Alrighty

[low condor]

||The biggest issue with the naive approach of just using lists is that the list grows exponentially. But there's not much value to using a list here. A list contains ordered data - do you think that there's any ordered data here? If not, how could you transform this data into another format?||

[robust heart]

||you mean, since we have finite values, we can sort them up in a dictionary or even a list with the corresponding indexes as keys?||

||the keys would be the timer values and the values would be the number of times each key would show up||

[rocky oar]

#advent-of-code-spoilers-archive ???

[low condor]

I am using spoiler tags here - but yeah, perhaps the last one was too much

[robust heart]

Sorry if it wasn’t the appropriate place

[tidal locust]

any suggestions on how to not ran out of memory on a pc for day 6?

[low condor]

look at some of my spoiler comments above. I think I'll delete the last one though

[tidal locust]

oh thx

[low condor]

And yeah, if you have follow up questions, ping me on the spoilers channel

[hollow wharf]

Just wrote a long-ass bit in my course evaluations flaming the CS course that I just took :)

what a shit course

[sleek cave]

i probably overthought everything... i was legit writing up recursive functions trying to calculate the number of fish that will spawn in each iteration and stuff

i should try another approach, today's puzzle is quite hard for me

[low condor]

You definitely overthought it lol

[low condor]

Would you like a hint?

[sleek cave]

only if i don't solve this in one more hour of tearing my hair out :P

thank you

[low condor]

!remind 1h is i love aoc bald?

[marsh current]

Absolutely!

Your reminder will arrive on <t:1638835280:F>!

ID: 3649

[sleek cave]

lmfao 🤣

[topaz summit]

this is a legitimate approach though

[sleek cave]

wat. well i can't get the recursion working and fiddle fontaine gave me a slight hint saying that's overthinking so

[topaz summit]

err the recursion, idk why the reply was something else

i didnt do it with recursion, but its possible and relatively simple

not necessarily easy though

[low condor]

Yeah I assumed they were thinking that they needed recursion

which is why I said they were overthinking it 🙂

[sleek cave]

NO WAY

I'M ON A TRACK

IF THIS TRACK LEADS ME TO AN ABYSS I SHALL CRY

BUT I DON'T THINK SO

[low condor]

Looking like 1hr will be too much 🙂

I'm imagining the track in Back to the Future 3

Do you ride the train into the modern day or fall into the canyon below 🤔

[sleek cave]

MODERN DAY MODERN DAY MODERN DAY

NOW I NEED TO PROGRAM THIS TRACK INTO AN ACTUAL SOLUTION

[sleek cave]

😔 i have a recursive solution but 256 still taking a long time

13 minutes til hint lol

[low condor]

no need to remind me, the bot will 🙂

[sleek cave]

oh no i'm just reminding myself that i have 10 more minutes until i officially end my aoc individual winning streak

[low condor]

aww 😦

[sleek cave]

scratch that; 0 minutes

[little siren]

.aoc join

[marsh current]

It has arrived!

Here's your reminder: is i love aoc bald?
[Jump back to when you created the reminder](#advent-of-code message)

[low condor]

turns out they were not @sleek cave 🙂

[sleek cave]

woohoo :DDDDDDD

man, aoc is good

i've said this like 256 times already

but man, aoc is good

so good

so fun

[hidden musk]

256 times

[low condor]

I just realised why it's 256

[hidden musk]

hm?

[low condor]

256 iterations in part 2

binary reference

tl;dr I'm dumb

[hidden musk]

oh

[marsh current]

It has arrived!

Here's your reminder: actually do this 😂
[Jump back to when you created the reminder](#advent-of-code message)

[sleek cave]

why would lanternfish be related to binary? or is it just a fun little arbitrary easter egg lol

[low condor]

arbitrary I'm sure

[hidden musk]

it's never arbitrary

[wooden jewel]

I think that's because ||you can solve this with matrix multiplication, and if it's a straight power of two it's easier to do M = M * M (or equivalent) 8 times than to figure out the more general fast matrix exponentiation algorithm||

That's just a guess tho

[low condor]

Can it not just be that a byte has 256 values and 256 was also convenient for a "large" number of iterations 😂

[wooden jewel]

🤷‍♀️

[humble escarp]

That (healthy) anger in me

I understand now that trying to wake up in the morning to do AoC

was intended

by the creator

I said in this channel doing AoC was the best decision of the year (because I learned so much in 5 days thanks to you guys <3)

[wooden jewel]

bother that nonsense, I'm not waking up at 6 for fake internet points :P

[humble escarp]

Going back to the video 😛

[sleek cave]

 1)  479   455 |  53.76%  51.07%
 2)  438   427 |  49.16%  47.92%
 3)  404   347 |  45.34%  38.95%
 4)  303   284 |  34.01%  31.87%
 5)  266   259 |  29.85%  29.07%
 6)  253   235 |  28.40%  26.37%

\
  \
    \
      v

unstonks.

[hidden musk]

📉

[tight dune]

very unstonky indeed

[sinful pawn]

:stinks:

[hazy pendant]

idiot filters every weekend

[signal grotto]

Ooh I did I’m good 👍 👌

[hollow wharf]

getting excited for today's :)

[frank maple]

me too ima use dictionary comprehensions everywhere

[rancid creek]

return filter(idiot, weekend)

[hazy pendant]

yes

[uneven hollow]

smoort

[hollow wharf]

everyone ready for day 7? >:3

[signal grotto]

sure 😂

[hollow wharf]

hmm

[velvet stag]

im redy

[hollow wharf]

day 6 killed my laptop at first

because i was brute forcing it

lol

[velvet stag]

only second time i'm awake for it

[hollow wharf]

like uh

when doing day 6, it took like 60 seconds to run it for 80 days

then it took like

over 10 minutes to do it for one fish

lol

on 256

so i had to change my code a lot

:3

[woven oriole]

whats the time there guys

[steel oyster]

aoc day 7 starts on 12:00 PM for me

[woven oriole]

oh cool

ig many of them have midnight ++ due to timezone diff

[hollow wharf]

:3

12:00 am for me

lol

EST timezone go brrr

[woven oriole]

damn

[winter vigil]

man i just learned about defaultdicts today

they are a god send

[steel oyster]

15 more minnutes

[hollow wharf]

they're interesting

also is @marsh current busted rn?

!e print("hi")

[marsh current]

Sorry, an unexpected error occurred. Please let us know!

ClientResponseError: 500, message='Internal Server Error', url=URL('http://snekbox.default.svc.cluster.local/eval')

[steel oyster]

!e print("im fine")

[marsh current]

Sorry, an unexpected error occurred. Please let us know!

ClientResponseError: 500, message='Internal Server Error', url=URL('http://snekbox.default.svc.cluster.local/eval')

[steel oyster]

uh..

[north silo]

Yeah, not working right now sorry.

[minor cave]

!ping

[marsh current]

Pong!

Command processing time

84.580 ms

Python Discord website status

Healthy

Discord API latency

107.446 ms

[hollow wharf]

weird

[winter vigil]

!e

print("hello world")```

[marsh current]

Sorry, an unexpected error occurred. Please let us know!

ClientResponseError: 500, message='Internal Server Error', url=URL('http://snekbox.default.svc.cluster.local/eval')

[minor cave]

Okay, just snekbox

[hollow wharf]

any idea why?

[minor cave]

Python is fine.

[sharp panther]

joe's working on it (#ot0-psvm’s-eternal-disapproval message)

[minor cave]

Likely the k8s upgrade mangled snekbox a bit

[hollow wharf]

who's joe 👀 /j

[winter vigil]

how exactly is this interpreter safe to use?

[hollow wharf]

they disabled like everything you could break it with

lol

[north silo]

It's sandboxed

[minor cave]

Sandboxed to oblivion essentialy

[sharp panther]

very. It runs subprocess in nsjail.

[winter vigil]

ah i see

[pearl needle]

what's a quick way to parse this kind of structure (related to a previous year aoc): txt aaa: b bb: aaaa b abc: aabc bdb dff bbbddf: ffff the format would many lines of key: value1 value2 ... for one or more values. I'm trying to find a one-liner regex for it but can't figure it out

[winter vigil]

i tried making something similair in my bot, but i didn't want to make use of the exec() function

[minor cave]

It's a very carefully constructed ironbox of an nsjail running in a docker container

[sharp panther]

If you want to take a look, the source is available at https://git.pydis.com/snekbox.

[winter vigil]

does this act like an API?

[minor cave]

So Python just does python -c your_code_here and sends that query off to snekbox to execute. At no point does our bot actually execute it

[north silo]

Btw, Advent of Code <t:1638853200:R>

[minor cave]

Yup!

[sonic silo]

en solo 12 mins :o

damn its cold

[hollow wharf]

that's true

[winter vigil]

ah so it just sends the given code into the request body

[sharp panther]

yeah

[hollow wharf]

very cold

lol

[winter vigil]

very cool

[steel oyster]

let me get my template ready, 1 sec...🏃‍♂️

[minor cave]

Yeah, the docker container takes it in, nsjail executes the subprocess with fairly strict limits, and then we return any output

[sonic silo]

its 6 am in here

[winter vigil]

what is line limit for the given script

[sonic silo]

wait

[hollow wharf]

11:51 pm here

[sonic silo]

thats 35 F

uhh

[steel oyster]

same

[hollow wharf]

p o g

[sonic silo]

thats below 0C?

[hollow wharf]

barely above it

[minor cave]

Mmmm, good question. I'm not sure, but if I were to guess I'd guess the discord limit of 2k

[hollow wharf]

2F over 0C

[woven oriole]

equal to embed size?

[sonic silo]

dam

[woven oriole]

ig

[hollow wharf]

lol

[winter vigil]

i am assuming that it would return a time out error if you just passed this in for example:

while True:
  .....```

[woven oriole]

memory error

[hollow wharf]

something definitely happens

lol

[hazy pendant]

jail

[minor cave]

Yup! We have timeout limits, memory usage limits, no internet connection, aaaand I think we limit to 2 or 3 processes (we allow more than one so people can illustrate threading/async/various)

[hazy pendant]

💀

[hollow wharf]

lol

can't use requests or anything

[hazy pendant]

11:53 am here

[hollow wharf]

same

[hazy pendant]

no

i'm in am

you're in pm

[hollow wharf]

oh

i misread

lol

[hazy pendant]

lol

[steel oyster]

wait, you said pm

[minor cave]

.aoc c

[hidden copper]

Day 7 starts <t:1638853200:R>.

[narrow crown]

5 minutes left but i cant do anything

[hollow wharf]

yo-

:3

[narrow crown]

lesgo

still hsvent read day 5 cuz school

[hollow wharf]

awh

i'm sorry

[hazy pendant]

also

[late frigate]

gg

[hazy pendant]

did your computer overheat on day 6

[hollow wharf]

uh

[steel oyster]

no it didnt, somehow...

[hollow wharf]

:3

[winter vigil]

wait did you use the naive solution?

[hazy pendant]

ur rich

[steel oyster]

no

[winter vigil]

with the growing list

oh

interesting

[hollow wharf]

nah i just saved the entire summer

plus some

without spending a thing

[hazy pendant]

my god

[steel oyster]

didnt even give the correct answer

[narrow crown]

how did u save up

[mystic plover]

download ram

[hollow wharf]

by being 16

and not having expenses

[narrow crown]

lucky

[hollow wharf]

lol

[narrow crown]

oh yeah tax fraud

as a child

[hollow wharf]

:3

lol

[hollow wharf]

nO

.aoc c

[hidden copper]

Day 7 starts <t:1638853200:R>.

[hollow wharf]

so close

[narrow crown]

download gta6 for free

[hazy pendant]

python3.10 not in apt :(

[hollow wharf]

apt?

[narrow crown]

rip school

[jade atlas]

The timing for aoc is completely unfair to me. Its 1030 and I need to do my job also 😫

[hollow wharf]

pff

[stable heron]

use pyenv

[woven oriole]

sad

[steel oyster]

:('

[stable heron]

aoc timings should be individual

[steel oyster]

.aoc c

[hidden copper]

Day 7 starts <t:1638853200:R>.

[woven oriole]

50

[jade atlas]

Then you get lots of copy pastas

[north silo]

[hazy pendant]

oh wait deadsnakes ppa

[pearl needle]

there is no way to enforce individual timings

[jade atlas]

GL

[tulip elbow]

hf

[signal grotto]

You can still solve at any time

[prisma sundial]

gl

[woven oriole]

lx 's daily routine

smh

[magic bridge]

in my time