Advent of CodSpeed

A performance challenge based on the 2024 Advent of Code problems

Cycle I Leaderboard

Rank	Pts	Name
1	0
2	0
3	0
4	0
5	0
6	0
7	0
8	0
9	0
10	0
11	0
12	0
13	0
14	0
15	0
16	0
17	0
18	0
19	0
20	0
21	0
22	0
23	0
24	0
25	0

Rules and Frequently Asked Questions

The goal of Advent of CodSpeed is to create the fastest algorithm to solve each problem from Advent of Code, where every day during the month of December a new problem with two parts is released at midnight EST (UTC-5).

Participants have 36 hours to create the fastest solution for this problem and register it on CodSpeedHQ/Advent. At the end of the 36 hours—noon EST (UTC-5) of the next day, all the registered solutions for this day will be run and they will be ranked based on the total time to solve both parts of the problem.

For each day, points will be awarded based on the ranking of each participant. Each cycle of 5 days in the calendar will have dedicated prizes for the top 3 participants. The top 5 participants of the whole event will also win prizes.

Each person can participate with a single account and repository
A participant can win each cycle prize only once during the event. eg: if you finish 1st in cycle I you win a $50 Gift Card, then if you finish 1st in cycle II you win a $30 Gift Card, etc...
We reserve the right to disqualify any participant without notice if we suspect any foul play.

Considerations for the solutions:

Your code must be public
Submit only your own code. If you copy-pasted code from someone else, you will be removed from the leaderboard and not be able to win prizes
The solution must be correct and give the right answer to the problem. Any solution that is incorrect will be disqualified for that day.
The two parts of a day's problem must be treated separately in dayN::part1 and dayN::part2 functions. They both must work without relying on the other having been run. Any type of caching between the parts is thus disallowed.

Only Rust is supported at the moment

Setup a public GitHub repository
Expose a library that exposes a module for each day. Each module must expose a pub fn part1 and a pub fn part2 function that take a &str and return one of the following types:
- Integer:
- Floating-point: f32, f64
- Boolean: bool
- Single character: char
- Strings: &str, String
Ensure you are using Rust edition 2021.
For example, to solve part 2 of day 5, the following function will be called: crate::day5::part2(input).
We follow the standard defined in cargo-aoc for the project structure. See this example repository for a reference.
You can test that your solutions will be correctly picked up by the runner by following these instructions
Register your repository by opening this template issue and filling in the required information.
Every day at noon EST (UTC-5) starting December 2nd, a run will be created and look for the solution of the previous day. If it exists, it will run the solution and include it in the leaderboard.

We highly recommend setting up CodSpeed directly in your repository and use it to iterate on your solutions performance.
Find out how in our Rust documentation.

Each day, all the participants will be ranked based on the total to solve both parts of the problem.

The top 5 participants of the whole event will win the following main prizes:

MacBook Air M2
Nintendo Switch
Bose QuietComfort
Logitech MX Mechanical
Jbl Flip 6

The top 3 participants of each cycle of 5 days will win the following prizes:

$50 Steam Gift Card
$30 Steam Gift Card
$20 Steam Gift Card

Points will be awarded for the top 20 participants of each day. The scoring system is inspired by Formula One's points system.

Ranking	Points
1	50
2	40
3	35
4	31
5	28
6	25
7	22
8	19
9	16
10	14
11	12
12	10
13	8
14	7
15	6
16	5
17	4
18	3
19	2
20	1

Thanks to Eric Wastl for creating the Advent of Code. CodSpeed is not affiliated with the Advent of Code.

Resources Home Pricing Docs Blog GitHub Changelog Advent 🎄

Getting Started Sample repository Explore repositories Support

AboutCareers Contact Us Terms of Service Privacy Policy

{311862}Analyzed Commits

Explore Repos

Backed by

Rank	Pts	Name
1	0
2	0
3	0
4	0
5	0
6	0
7	0
8	0
9	0
10	0
11	0
12	0
13	0
14	0
15	0
16	0
17	0
18	0
19	0
20	0
21	0
22	0
23	0
24	0
25	0

Ranking	Points
1	50
2	40
3	35
4	31
5	28
6	25
7	22
8	19
9	16
10	14
11	12
12	10
13	8
14	7
15	6
16	5
17	4
18	3
19	2
20	1

Rank	Pts	Name
1	0
2	0
3	0
4	0
5	0
6	0
7	0
8	0
9	0
10	0
11	0
12	0
13	0
14	0
15	0
16	0
17	0
18	0
19	0
20	0
21	0
22	0
23	0
24	0
25	0

Ranking	Points
1	50
2	40
3	35
4	31
5	28
6	25
7	22
8	19
9	16
10	14
11	12
12	10
13	8
14	7
15	6
16	5
17	4
18	3
19	2
20	1

.css-ahjdgr{display:inline;background-image:linear-gradient(0deg, #FC6E39 20%, #FFAB67);color:transparent;-webkit-background-clip:text;background-clip:text;font-family:var(--chakra-fonts-mono);font-weight:var(--chakra-fontWeights-normal);}Cycle I Leaderboard

Rules and Frequently Asked Questions

Rules

How to participate in the challenge?

Scoring System and Prizes

Cycle I Leaderboard

Rank	Pts	Name
1	0
2	0
3	0
4	0
5	0
6	0
7	0
8	0
9	0
10	0
11	0
12	0
13	0
14	0
15	0
16	0
17	0
18	0
19	0
20	0
21	0
22	0
23	0
24	0
25	0

Ranking	Points
1	50
2	40
3	35
4	31
5	28
6	25
7	22
8	19
9	16
10	14
11	12
12	10
13	8
14	7
15	6
16	5
17	4
18	3
19	2
20	1