aoc2021
advent-of-code
aoc2021 | advent-of-code | |
---|---|---|
9 | 23 | |
1 | 20 | |
- | - | |
0.0 | 9.1 | |
9 months ago | 4 months ago | |
C | Rust | |
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.
aoc2021
-
[2021 day 6] What's you're fastest solution?
This in C runs in 215 us on a Pi 4 with the cpu in performance mode: https://github.com/ednl/aoc2021/blob/main/day06.c
-
[DAY 6] C# solution with commentary
I took a few hints from the solutions thread and made this in C which executes in 0.4 milliseconds on a Raspberry Pi 4: https://github.com/ednl/aoc2021/blob/main/day06.c
-
[2021 Day 18] [C++] Overcomplicated solution after a lot of grief and hair loss.
Good outcome. I'm not well versed in C++ so I can't say much about it. For my solution in C, I figured that a full-blown tree was too much work and also not really needed if I kept track of the level myself, because everything is always in the same order left to right, just expanding and contracting. So I used a linked list and a SF number became an array of SF digits where each digit is a struct { left,right,level,value }. I guess the trickiest bit was to do the accountancy of keeping everything linked correctly when exploding and splitting.
-
[2021] What did you learn or take away from AoC 2021?
The constant time thing is counting fish in an age histogram mod 9, right? I think that idea floated around the solution thread. I am no longer sure if I saw it there first or came up with it myself..... but here's my implementation in C: https://github.com/ednl/aoc2021/blob/main/day06.c
-
-🎄- 2021 Day 14 Solutions -🎄-
Added lots of comments as explanation of the ideas and the code: https://github.com/ednl/aoc2021/blob/main/day14.c
-
-🎄- 2021 Day 6 Solutions -🎄-
Good ol' C code. Very simple program once you think of making a circular buffer from the population histogram by age bins, and simulating every day. I got stuck for a while trying to come up with a direct mathematical function which never gave me the exact number. The crux:
-
-🎄- 2021 Day 4 Solutions -🎄-
C, which takes some bookkeeping but it can be fast. I didn't push for every last drop of speed but still: about 3 ms on a Raspberry Pi 4 (1.8 GHz overclock, Buster desktop, not very quiet so I picked a good run). Code with lots of comments
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:
What are some alternatives?
AdventOfCode
opencv-playground
aoc-2021 - Advent of code 2021 challenges written in Rust to learn the language and get more comfortable with the it (and sometimes I just use C++)
BenchmarkDotNet - Powerful .NET library for benchmarking
AdventOfCode - My Advent of Code solutions. I also upload videos of my solves: https://www.youtube.com/channel/UCuWLIm0l4sDpEe28t41WITA
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.
aoc_kotlin - Advent of code solutions in Kotlin
advent-of-code-2021 - AoC this year exclusively with Ruby
rockstar - The Rockstar programming language specification
advent-of-code-kotlin - Advent of code 2021 - Kotlin
AlgorithmProblems - Solutions to Algorithm Problems :chart_with_upwards_trend: :neckbeard:
aoc2021 - Solutions for Advent of Code 2021