advent-of-code-2022 VS AdventOfCode

Compare advent-of-code-2022 vs AdventOfCode and see what are their differences.

AdventOfCode

My Advent of Code solutions. I also upload videos of my solves: https://www.youtube.com/channel/UCuWLIm0l4sDpEe28t41WITA (by jonathanpaulson)
InfluxDB - Power Real-Time Data Analytics at Scale
Get real-time insights from all types of time series data with InfluxDB. Ingest, query, and analyze billions of data points in real-time with unbounded cardinality.
www.influxdata.com
featured
SaaSHub - Software Alternatives and Reviews
SaaSHub helps you find the best software and product alternatives
www.saashub.com
featured
advent-of-code-2022 AdventOfCode
1 26
0 324
- -
10.0 8.0
over 1 year ago 5 months ago
Rust Python
- -
The number of mentions indicates the total number of mentions that we've tracked plus the number of user suggested alternatives.
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-2022

Posts with mentions or reviews of advent-of-code-2022. We have used some of these posts to build our list of alternatives and similar projects. The last one was on 2022-12-02.
  • -🎄- 2022 Day 3 Solutions -🎄-
    250 projects | /r/adventofcode | 2 Dec 2022
    Rust 3a: use day_03::{intersect, priority}; fn main() { let input = include_bytes!("../../../input/day_03.txt"); let sum_of_priorities = input .split(|&byte| byte == b'\n') .map(|line| line.split_at(line.len() / 2)) // split into equally sized compartments .map(|(l, r)| intersect([l.iter().copied(), r.iter().copied()])) // find the intersection of the compartments .map(priority) // map to priorities .sum::(); println!("{}", sum_of_priorities); } 3b: use day_03::{intersect, priority}; fn main() { let input = include_bytes!("../../../input/day_03.txt"); let lines = input.split(|&byte| byte == b'\n').collect::>(); let sum_of_priorities = lines .chunks(3) .map(|chunks| intersect(chunks.iter().map(|chunk| chunk.iter().copied()))) .map(priority) // map to priorities .sum::(); println!("{}", sum_of_priorities); } shared code (module: `day_03`): use std::collections::HashSet; pub fn intersect(sets: I) -> u8 where I: IntoIterator, Set: IntoIterator, { let common = sets .into_iter() .map(|set| { let set: HashSet = HashSet::from_iter(set); set }) .reduce(|l, r| &l & &r); *common.unwrap().iter().next().unwrap() } pub fn priority(item: u8) -> u32 { (if item >= b'a' { item + 1 - b'a' } else { item + 27 - b'A' }) as u32 } repo: https://github.com/foresterre/advent-of-code-2022

AdventOfCode

Posts with mentions or reviews of AdventOfCode. We have used some of these posts to build our list of alternatives and similar projects. The last one was on 2023-12-06.

What are some alternatives?

When comparing advent-of-code-2022 and AdventOfCode you can also consider the following projects:

aocrunner - Advent of Code runner

adventofcode - My solutions to the Advent of Code challenges

AdventOfCode2022

Advent-of-Code - Advent of Code

advent-of-code - My solutions for adventofcode.com

Advent_of_Code_in_Pascal - My solutions to the Advent of Code, in Free Pascal

advent - Solutions to https://adventofcode.com/

advent-of-code

adventofcode - Advent of Code solutions of 2015, 2016, 2017, 2018, 2019, 2020, 2021, 2022 and 2023 in Scala

advent-of-code

adventofcode - :christmas_tree: Advent of Code (2015-2023) in C#

aoc2021 - Advent of Code 2021 on my homemade 16-bit CPU SCAMP