https://github.com/ilia-kosenkov/advent-of-code-2022

https://github.com/ilia-kosenkov/advent-of-code-2022

Last synced: 19 days ago
JSON representation

• Host: GitHub
• URL: https://github.com/ilia-kosenkov/advent-of-code-2022
• Owner: Ilia-Kosenkov
• License: mit
• Created: 2022-12-16T15:02:23.000Z (almost 2 years ago)
• Default Branch: main
• Last Pushed: 2022-12-25T22:47:10.000Z (almost 2 years ago)
• Last Synced: 2024-10-07T08:10:10.770Z (about 1 month ago)
• Language: Rust
• Size: 72.3 KB
• Stars: 0
• Watchers: 2
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README.md
  • License: LICENSE

Awesome Lists containing this project

README

        
# My (late) attempt at [AdventOfCode2022](https://adventofcode.com/2022)

The tasks are solved in Rust.

So far, for tasks that have lengthy inputs, the goal is to compute everything in one go, i.e. write a pipeline that reads lines from `stdin` and produces an output. No `.collect()`. External dependencies are also minimized (and mostly avoided).

### How to run it?

Get your input puzzle into, e.g., a file named `input.txt` and send it to the `stdin` of the binary. When using `pwsh`, it can be done like this

```pwsh

cat input.txt | cargo run

```

- [Task 1](./01)

- [Task 2](./02)

- [Task 3](./03)