advent-of-code
adventofcode
advent-of-code | adventofcode | |
---|---|---|
23 | 59 | |
20 | 6 | |
- | - | |
9.1 | 8.5 | |
4 months ago | 4 months ago | |
Rust | Julia | |
- | MIT License |
Stars - the number of stars that a project has on GitHub. Growth - month over month growth in stars.
Activity is a relative number indicating how actively a project is being developed. Recent commits have higher weight than older ones.
For example, an activity of 9.0 indicates that a project is amongst the top 10% of the most actively developed projects that we are tracking.
advent-of-code
-
Day 18 (Advent of Code 2022), porting C++ solution to Rust, by fasterthanlime
I just did simple BFS on the lava cubes for part 1. For part 2, I just did a BFS on the bounding cube. Total runtime - 500 micro seconds for both parts on my 8 years old laptop: https://github.com/SvetlinZarev/advent-of-code/blob/main/2022/aoc-day-18/src/lib.rs
-
[2022 Day 16 (Part 1)][TypeScript] Can someone explain the general logic?
My solution is pretty simple - top down DP. On each step we can do only one of two things: * open a valve and stay in current position * do not open a vale, but move to a different positions
-
-🎄- 2022 Day 12 Solutions -🎄-
🦀🦀🦀 RUST 🦀🦀🦀
-
[2022 Day 4] Rust – Looking for advice on idiomatic parsing
You can see it in action here: https://github.com/SvetlinZarev/advent-of-code/blob/main/2022/aoc-day-04/src/lib.rs
-
-🎄- 2022 Day 1 Solutions -🎄-
Rust
-
[2021 day 6] What's you're fastest solution?
Here are the results of my benchmarks, which you can also run
-
Optimal algo for 2021 Day 19?
You can calculate the distances between the points found by each scanner. If two scanners report points with the same distance between them, then most probably they are adjacent. Runs in 4ms on my machine: https://github.com/SvetlinZarev/advent-of-code/tree/main/2021/aoc-day-19
-
go-faster/ch: fastest ClickHouse client, faster than Rust and C++
You can copy the release profile from here https://github.com/SvetlinZarev/advent-of-code/blob/main/2021/aoc-day-25/Cargo.toml#L8 and copy that directory to enable compilation for the machine's cpu https://github.com/SvetlinZarev/advent-of-code/tree/main/2021/aoc-day-25/.cargo
-
[2021][RUST] My solutions for AoC 2021 in Rust
I want to share my repo for whoever is interested. It contains Rust solutions for:
-
No clue how other people are hitting <200ms on Day 23 (C++)
Mine (rust)runs for 50ms for both parts. I've used just a regular bruteforce approach, so nothing fancy. There are several things I did that reduced the execution time:
adventofcode
-
-❄️- 2023 Day 10 Solutions -❄️-
Code on GitHub is currently a mess.
-
[2023 Day 5] Exlplanation Like I'm 5
In the spirit of the Day 5 ALLEZ CUISINE! challenge to ELI5 (Explain Like I'm Five), here's a tasty explanation of how my algorithm works using only a large bucket of Red Vines and a knife. It says to use lined paper, but if you try this at home consider aligning things on a cutting board.
-
-❄️- 2023 Day 4 Solutions -❄️-
[Language: Jsonnet] (on GitHub)
- -🎄- 2022 Day 25 Solutions -🎄-
-
-🎄- 2022 Day 24 Solutions -🎄-
Elixir code, thoughts
-
-🎄- 2022 Day 23 Solutions -🎄-
Elixir 1554/1502 code, reflections
-
-🎄- 2022 Day 21 Solutions -🎄-
Elixir 2506/3402 (24 minutes, 2 hours), code, thoughts
-
-🎄- 2022 Day 20 Solutions -🎄-
Bonus solution in Go (golang) because I was confused about why my Elixir solution didn't work and decided to implement from scratch in case I'd done something dumb. The Go one also got the wrong answer, but took less than 100ms instead of a minute, so I could try out lots of tweaks that didn't change the answer.
-
-🎄- 2022 Day 19 Solutions -🎄-
Elixir 2031/2641 after 3.25/6.5 hours! Code on GitHub
-
-🎄- 2022 Day 18 Solutions -🎄-
I spent time this afternoon sprucing up my helpers for the iex REPL. I spent a bunch of time poking at things in IEx the last couple days and wanted to make sure I would minimize keystrokes if I needed to debug things on my phone while drunk. Turns out Thursday night > Friday night > Saturday night in terms of difficulty, so all those macros have so far saved me zero seconds :-)
What are some alternatives?
opencv-playground
adventofcode - Solutions for problems from AdventOfCode.com
BenchmarkDotNet - Powerful .NET library for benchmarking
adventofcode - Advent of Code solutions of 2015, 2016, 2017, 2018, 2019, 2020, 2021, 2022 and 2023 in Scala
AdventOfCode - My Advent of Code solutions. I also upload videos of my solves: https://www.youtube.com/channel/UCuWLIm0l4sDpEe28t41WITA
aoc2021 - Advent of Code 2021 - my answers
perlweeklychallenge-club - Knowledge base for The Weekly Challenge club members using Perl, Raku, Ada, APL, Awk, Bash, BASIC, Bc, Befunge-93, Bourne Shell, BQN, Brainfuck, C3, C, CESIL, C++, C#, Clojure, COBOL, Coconut, Crystal, D, Dart, Dc, Elm, Emacs Lisp, Erlang, Excel VBA, Fennel, Fish, Forth, Fortran, Gembase, GNAT, Go, Haskell, Haxe, HTML, Idris, IO, J, Janet, Java, JavaScript, Julia, Kotlin, Lisp, Lua, M4, Miranda, Modula 3, MMIX, Mumps, Myrddin, Nim, Nix, Node.js, Nuweb, OCaml, Odin, Ook, Pascal, PHP, Python, Postscript, Prolog, R, Ring, Ruby, Rust, Scala, Scheme, Sed, Smalltalk, SQL, Swift, Tcl, TypeScript, Visual BASIC, WebAssembly, Wolfram, XSLT and Zig.
AdventOfCode2021.jl - Advent of Code 2021 in Julia
aoc_kotlin - Advent of code solutions in Kotlin
aoc2021 - Advent of Code 2021 on my homemade 16-bit CPU SCAMP
advent-of-code-2021 - AoC this year exclusively with Ruby
rockstar - The Rockstar programming language specification