Claude's C Compiler vs. GCC | Discussion
09.02.2026 05:40
๐ 3
๐ 3
๐ฌ 0
๐ 0
Last time I watched this was 2ish years ago and it's definitely different since then. They're editing episodes 6+ years after they're released??
Rewatching Silicon Valley and I swear they've made extremely minor changes in nearly every episode, adding voice lines that are under a second long. It's all over the place
Advent of Code 2025 done! ๐ฅณ
I'm actually glad this year was shorter, made it way less stressful. Got trolled a bit on the final problem, but this was a lot of fun :)
Good luck!!!!!
Advent of Code 2025's completion screen.
๐ฅณ
Advent of Code Day 11 Part 1 solution, using a recursive CTE to calculate paths between nodes.
Advent of Code 2025 Day 10 Part 2 solution, using Python/z3 inside of a Postgres database to solve systems of equations.
Advent of Code 2025 Days 10/11 blog posts now up!
Day 10 Part 2 sucked, I hate that the standard solution for those problems is "just use z3". But glad I could do something fun at least
Day 11 was the first time I nailed using a recursive CTE with zero assistance, very happy about that! ๐
Yeah ๐
Quick visualization while untangling AoC 2025 Day 11 Part 2.
#AdventOfCode #networkx
Personal times for Advent of Code 2025.
Screenshot of Postico 2 with my table definitions for Day 11 Part 2.
Advent of Code 2025 Day 11 done!
Part 2 just required memoization ๐คฆโโ๏ธ took way longer than it should have, but at least Part 1 was easy!!
Still drained from Day 10, gonna chill for tonight and do a write-up tomorrow
Screenshot of Postico 2 SQL workbench tool showing two statements. The first is "CREATE EXTENSION plpython3u;", which creates the Python extension (allowing you to run Python code from SQL). The second is creating a function that uses the z3-solver library in Python, but the function is defined in Postgres using the plpython3u extension.
Ended up using Z3, but at least I found a way to do something a little fun with it
LETS FUCKING GOOOOOOOOOO
If you can't beat em, join em ยฏ\_(ใ)_/ยฏ
Not thrilled about it but did find a workaround ๐
I hate having to fall back to Z3 for these problems ๐ญ
Oh well, tomorrow problem!
First night I'm not solving both parts in one go ๐ญ Part 1 was a bit challenging but my brute-force solution worked. I seemingly can't get a fast enough BFS solution for Part 2, so matter what I do
Glad I could help ๐
Today was also the fastest I've finished AoC this year! 6:41 for Part 1, 36:10 for Part 2
Desmos graphing calculator displaying the challenge prompt for Advent of Code 2025 Day 9 as a polygon.
Advent of Code 2025 Day 9 done!
I knew exactly what Part 2 would be as soon as I saw Part 1. I didn't bother coming up with a general solution, just wrote a quick and dirty query with some shortcuts
Plotted the points in Desmos to help find those shortcuts ๐
And got around to a quick write-up of my Day 7 solutions: fletcheaston.com/advent-of-co...
SQL query calculating the final result for my Advent of Code 2025 Day 8 Part 2 solution. The query selects the last member from the "circuit members" table, finds the closest node to it, and returns the x-coordinates of the two nodes multiplied together.
Advent of Code 2025 Day 8 done!
It took me way too long to figure out what the prompt was even asking me for Part 1 ๐ญ And of course there was an edge case that I hadn't accounted for
Part 2 was relatively easy though!!
Interesting, never heard of Delaunay triangulation before. Thanks for sharing a thing to look into :)
I did very briefly consider Apache AGE for this one, but was easy enough to do in plain old Postgres once I figured out what the prompt was even asking ๐
But yeah, a very simply graph structure with nodes and edges :)
LOL
