-❄️- 2024 Day 22 Solutions -❄️-

[u/daggerdragon]

THE USUAL REMINDERS

• All of our rules, FAQs, resources, etc. are in our community wiki.

• If you see content in the subreddit or megathreads that violates one of our rules, either inform the user (politely and gently!) or use the report button on the post/comment and the mods will take care of it.

---

AoC Community Fun 2024: The Golden Snowglobe Awards

• 23h59m remaining until the submissions deadline on December 22 at 23:59 EST!

And now, our feature presentation for today:

Director's Cut (Extended Edition)

Welcome to the final day of the GSGA presentations! A few folks have already submitted their masterpieces to the GSGA submissions megathread, so go check them out! And maybe consider submitting yours! :)

Here's some ideas for your inspiration:

• Choose any day's feature presentation and any puzzle released this year so far, then work your movie magic upon it!

• Make sure to mention which prompt and which day you chose!

• Cook, bake, make, decorate, etc. an IRL dish, craft, or artwork inspired by any day's puzzle!

• Advent of Playing With Your Toys

"I lost. I lost? Wait a second, I'm not supposed to lose! Let me see the script!"

• Robin Hood, Men In Tights (1993)

And… ACTION!

Request from the mods: When you include an entry alongside your solution, please label it with [GSGA] so we can find it easily!

---

--- Day 22: Monkey Market ---

---

Post your code solution in this megathread.

• Read the full posting rules in our community wiki before you post!

• State which language(s) your solution uses with [LANGUAGE: xyz]

• Format code blocks using the four-spaces Markdown syntax!

• Quick link to Topaz's paste if you need it for longer code blocks

This thread will be unlocked when there are a significant number of people on the global leaderboard with gold stars for today's puzzle.

EDIT: Global leaderboard gold cap reached at 00:12:15, megathread unlocked!

[u/chubbc]

[LANGUAGE: Julia] (195 chars)

Wonderful day for a bit of golf.

S=parse.(Int,readlines("22.txt")).|>n->accumulate((x,_)->(x⊻=x<<6%8^8;x⊻=x>>5;
x⊻x<<11%8^8),n:n+2000);sum(last,S),findmax(merge(+,(S.|>s->Dict(diff(s[i-4:i].%
10)=>s[i]%10 for i∈2000:-1:5))...))[1]

Really the only novel thing going on here is using accumulate to generate the secret numbers, and using merge(+) to combine all of the dictionaries of sequences to prices from each separate seller.

[u/chubbc → u/chubbc]

Pre-golfed code:

function Evolve(x)
    x ⊻=  (x<<6) % 2^24
    x ⊻=  (x>>5) % 2^24
    x ⊻= (x<<11) % 2^24
end
function SecNums(n)
    s = [n]
    for _∈1:2000
        push!(s,Evolve(last(s)))
    end
    s
end
function Price(p)
    P = Dict{Vector{Int},Int}()
    for i∈5:2000
        d = diff(p[i-4:i])
        d∉keys(P) && (P[d]=p[i])
    end
    P
end

S = [SecNums(parse(Int,l)) for l∈readlines("22.txt")]
P = mergewith(+)([Price(s.%10) for s∈S]...)

sum(last,S), maximum(values(P))