I got mine down to ~225ms, but I dont see any other obvious ways to optimize from here - I tried to memoize decks between games, but that increased the run time.
camilleryr
felix-alonso
Oh, man, I thought this one was pretty easy, but then I couldn’t get it to run. Turns out I misread the subgame condition. I thought it was when at least one was equal to the remaining cards in the deck. That makes a pretty big difference. Overall, mine is pretty slow compared, but I think I’m fine for now.
0
code-shoily
cblavier
Hi there 
Can anyone help me with my part2 code which seem to run indefinitely? (more than 60sec)
I read the instructions many times and I can’t figure out the problem.
Tahnks for your help!
0
bjorng
Erlang Core Team
Your solution finishes in about 80 seconds on my computer.
The culprit is your key/1 function:
def key(decks) do
:crypto.hash(:md5, inspect(decks))
end
This key calculation will lead to a more compact key, but the key calculation is very expensive. By using the lists of the decks directly as the key:
def key(decks), do: decks
the runtime is reduced to less than a second on my computer.
1
cblavier
Oh thank you!
I was really sure I had an infinite loop issue, not an optimization one. Got it now
1