Is there a private leaderboard?

Less than 2^11 minutes

I demand powers of two!

My phone somehow rang my alarm an hour late

Like last year, I will try to solve the puzzles using only Kotlin common code, and do some naive performance measurements of the solutions on the JVM, in Node and native on windows. Results are logged at https://github.com/jorispz/aoc-2019. Today I was pretty surprised that the native code took longer to run on each iteration (I run every solution 25 times in an internal loop). First iteration takes about 3ms, then it quickly increased to around 30ms. I have no clue what happens there. Averages for today: JVM 3.07ms, Node 31.39ms, Native 23.88ms

Day 1 is done!

I'm starting with this template I was suggested: https://github.com/stkent/AdventOfCode2019Template. But, how do I actually use it? How do I set it up so that the file is read in?

Yeah, I couldn't resist prematurely optimizing (hopefully...) for later this month, and have started the skeleton for a guidance computer emulator. Performance was terrible on JS and native, with a warm JVM finishing in about 150ms, while JS and native took 5-10s each run

I converted my python code to Kotlin using the ne worksheets and I think It'd be fine to switch. I think I can reach similar coding speeds.

This day1->day2 jump seems a little bigger than in previous years to me. Problems do tend to get harder throughout the 25 days, though not monotonically.

I'm guessing 19690720 is a constant across all inputs? Meaning: it's not like our input set which is one of a few and (probably) changes between people. True?

Used recursion second day in a row. Can we keep it up? (should we?) https://github.com/edgars-supe/advent-of-code/blob/master/src/main/kotlin/lv/esupe/aoc/year2019/Day2.kt

Today's post

for part 2 my code works for each example but not my data

Under what license should I release my source code?

For today’s post - in the puzzle input how do I Determine where to start from? I.e where is my central port (o) ?

Here's mine for today. I'll write my blog post on it later: https://github.com/tginsberg/advent-2019-kotlin/blob/master/src/main/kotlin/com/ginsberg/advent2019/Day03.kt

Today's puzzle made me come up with a monster:

intersectAllBy

https://github.com/TheMrMilchmann/AdventOfCode2019/blob/f42664c0330b1ba9010c6aac498d79d4fb094489/src/main/kotlin/day03/part2/main.kt#L67

Yeah, I managed to reuse my

Position

and

Heading

classes from last year after some dusting off. My solution: https://github.com/jorispz/aoc-2019/blob/master/src/commonMain/kotlin/day3/p03.kt I started using a fancy Sequence-based solution until I realized that I needed the whole history of visited points anyway, so dropped that and just went for creating a ListPosition per wire and find the crossing points as above.

This raises an interesting question: should we create a solution that solves our input or a solution that solves any input?

Got my blog post done: https://todd.ginsberg.com/post/advent-of-code/2019/day3/

Mistakes I made: (In thread cause don't want spoilers in mainchat)

I made a few points functions: https://github.com/Kroppeb/AdventOfCodeSolutions/blob/master/src/helpers/Point.kt

Day 4: https://github.com/tginsberg/advent-2019-kotlin/blob/master/src/main/kotlin/com/ginsberg/advent2019/Day04.kt

I wrote a regex for the first part and then I wasted about an hour trying to write a regex for the second one as well 😕.

@todd.ginsberg just read one of your blog posts, amazing effort and very fun to read! 👏

Thanks @todd.ginsberg for directing me here from Twitter 🙂 Hope to get involved in some discussions over the next days. So far, here are my solutions https://github.com/sustainablepace/Advent-of-Code-2019/tree/master/src/main/kotlin/advent_of_code Glad to be here!

Wrote up today: https://todd.ginsberg.com/post/advent-of-code/2019/day4/