#day05 — Public Fediverse posts
Live and recent posts from across the Fediverse tagged #day05, aggregated by home.social.
-
Day 5: 'That the pavement artist can gain a living is a testimony to the number of rainless days that London enjoys. Many spectators, alas, regard the entertainment as free.' An Advent Calendar of London a century ago, from 'Wonderful London', 1925, 📷Donald Macleish. #AdventLondon100 #Day05
-
Calendrier de l'Avent des fromages
Jour 05: Laguiole AOPFamille: vache
Lait: cru
Type de pâte: pressée non cuite
Région: Occitanie
Matières grasses: 30%Produit obligatoirement entre 800 et 1400 m d'altitude, ce fromage me rappelle le goût et la texture d'un jeune parmesan avec une note d'aigreur en bouche. L'accord avec une tartine au miel est très reussi.
Note: 7/10
#AdventsCalendar #Cheese #Fromage #CalendrierDeLAvent #Laguiole #Jour05 #Day05 #LaBoiteDuFromager2025
-
CW: Advent of Code 2025 Day 5 solution
Day 5 done. Now this one was the easiest one so far. I was shocked at how simple part 2 was. Just combining all overlapping ranges and doing some simple arithmetic. I initially tried a linear search, and it finished in 1.5ms. Then I switched to a binary search, and now it finishes in 1.7ms. Do not underestimate the power of the processor cache line. If the fresh ranges list were much larger, the binary search would have sped it up, I'm sure.
#AdventOfCode #AdventOfCode2025 #AdventOfCode2025Day5 #AdventOfCode2025Day05 #Day5 #Day05 #Rust #RustLang #Programming #codingchallenges
-
CW: Advent of Code 2025 Day 5 solution
Day 5 done. Now this one was the easiest one so far. I was shocked at how simple part 2 was. Just combining all overlapping ranges and doing some simple arithmetic. I initially tried a linear search, and it finished in 1.5ms. Then I switched to a binary search, and now it finishes in 1.7ms. Do not underestimate the power of the processor cache line. If the fresh ranges list were much larger, the binary search would have sped it up, I'm sure.
#AdventOfCode #AdventOfCode2025 #AdventOfCode2025Day5 #AdventOfCode2025Day05 #Day5 #Day05 #Rust #RustLang #Programming #codingchallenges
-
CW: Advent of Code 2025 Day 5 solution
Day 5 done. Now this one was the easiest one so far. I was shocked at how simple part 2 was. Just combining all overlapping ranges and doing some simple arithmetic. I initially tried a linear search, and it finished in 1.5ms. Then I switched to a binary search, and now it finishes in 1.7ms. Do not underestimate the power of the processor cache line. If the fresh ranges list were much larger, the binary search would have sped it up, I'm sure.
#AdventOfCode #AdventOfCode2025 #AdventOfCode2025Day5 #AdventOfCode2025Day05 #Day5 #Day05 #Rust #RustLang #Programming #codingchallenges
-
CW: Advent of Code 2025 Day 5 solution
Day 5 done. Now this one was the easiest one so far. I was shocked at how simple part 2 was. Just combining all overlapping ranges and doing some simple arithmetic. I initially tried a linear search, and it finished in 1.5ms. Then I switched to a binary search, and now it finishes in 1.7ms. Do not underestimate the power of the processor cache line. If the fresh ranges list were much larger, the binary search would have sped it up, I'm sure.
#AdventOfCode #AdventOfCode2025 #AdventOfCode2025Day5 #AdventOfCode2025Day05 #Day5 #Day05 #Rust #RustLang #Programming #codingchallenges
-
CW: Advent of Code 2025 Day 5 solution
Day 5 done. Now this one was the easiest one so far. I was shocked at how simple part 2 was. Just combining all overlapping ranges and doing some simple arithmetic. I initially tried a linear search, and it finished in 1.5ms. Then I switched to a binary search, and now it finishes in 1.7ms. Do not underestimate the power of the processor cache line. If the fresh ranges list were much larger, the binary search would have sped it up, I'm sure.
#AdventOfCode #AdventOfCode2025 #AdventOfCode2025Day5 #AdventOfCode2025Day05 #Day5 #Day05 #Rust #RustLang #Programming #codingchallenges
-
I (finally!) completed #Day05 of #AdventOfCode2023.
Part 1:
- Difficulty: 4/10
- Workout: 3/10Part 2:
- Difficulty: 5/10
- Workout: 7/10Part 1 was completed in 1 hour. Early in the game, I noticed that the mappings, with billions of elements, were too big to fit explicitly in memory. So, I created a function to pass one seed through the mapping, only checking the intervals' end points.
Then part 2 came, with billions of seeds to check. Brute forcing was a lost cause: tried it, lost 2 hours, expected another 6 to be done.
I had to resort to clever set operations (intersection and difference) over intervals: several folks had this idea. Split seed intervals over each mapping: common intervals are mapped to destination intervals, seeds not in common intervals make their own intervals and pass unchanged. The result is a list of intervals, to pass as input "seeds" to the next mapping.
Now part 2 was almost immediate, the seeds having been pulverized into just a few hundred intervals.
Total elapsed time: about 8 hours. Whew!
-
I completed #Day05 of #AdventOfCode2015, just for the fun of it.
Part 1:
- Difficulty: 2/10
- Workout: 1/10Part 2:
- Difficulty: 1/10
- Workout: 0/10Barely half hour of work. A nice workout on regular expressions. Seldom I used \1 before.
-
Walking through the narrow cold streets of old-town Girona in the late morning before our speed train trip back to Barcelona. It was a lovely 24 hours catching up with our friends and the kids had a blast. I was surprised by how cold it was walking along the narrow streets, but the buildings were almost all around three stories tall and the streets were mostly just wide enough for a horse and buggy - maybe. #Day05 #365happydays2023 #childhood #friendship #argentinosporelmundo #photography /1