Me too.
By the way, here’s my AoC-2017 Day 3 Part 2 solution, though I worked out today, and far from optimal 
#!/usr/bin/env elixir
input = 265149 # my input number
step = fn
{n, {n, y}} when y == -n -> {n + 1, {n + 1, y}} # bottom-right
{n, {x, y}} when y == -n -> {n, {x + 1, y}} # towards bottom-right
{n, {n, n}} -> {n, {n - 1, n}} # top-right
{n, {n, y}} -> {n, {n, y + 1}} # towards top-right
{n, {x, n}} when x == -n -> {n, {x, n - 1}} # top-left
{n, {x, n}} -> {n, {x - 1, n}} # towards top-left
{n, {x, y}} when x == -n and y == -n -> {n, {x + 1, y}} # bottom-left
{n, {x, y}} when x == -n -> {n, {x, y - 1}} # towards bottom-left
end
{%{{0, 0} => 1}, {1, {1, 0}}}
|> Stream.unfold(fn {map, {_, {x, y}} = s} ->
sum = for i <- -1..1, j <- -1..1, reduce: 0 do
sum -> sum + Map.get(map, {x + i, y + j}, 0)
end
map = Map.put(map, {x, y}, sum)
{map, {map, step.(s)}}
end)
|> Stream.map(&Enum.max(Map.values(&1)))
|> Stream.drop_while(& &1 <= input)
|> Enum.at(0)
|> IO.inspect()
