Skip to content

Commit

Permalink
Add readmes with run times
Browse files Browse the repository at this point in the history
  • Loading branch information
agagniere committed Dec 8, 2024
1 parent 84ff3f2 commit dc44f24
Show file tree
Hide file tree
Showing 7 changed files with 46 additions and 4 deletions.
10 changes: 10 additions & 0 deletions 2024/03/README.md
Original file line number Diff line number Diff line change
@@ -0,0 +1,10 @@
# Day 3

[Statement](https://adventofcode.com/2024/day/3)

```console
$ zig build --release run < input.txt
Program output: xxxxxxxx
With branching: xxxxxxx
get next line: 7.625us, part 1 & 2: 5.125us
```
2 changes: 1 addition & 1 deletion 2024/03/build.zig
Original file line number Diff line number Diff line change
Expand Up @@ -2,7 +2,7 @@ const std = @import("std");

pub fn build(b: *std.Build) void {
const target = b.standardTargetOptions(.{});
const optimize = b.standardOptimizeOption(.{});
const optimize = b.standardOptimizeOption(.{ .preferred_optimize_mode = .ReleaseFast });

const utils = b.dependency("utils", .{ .target = target, .optimize = optimize }).module("utils");

Expand Down
9 changes: 7 additions & 2 deletions 2024/03/solve.zig
Original file line number Diff line number Diff line change
Expand Up @@ -78,14 +78,19 @@ pub fn main() !void {
var stdin = std.io.bufferedReader(std.io.getStdIn().reader());
var lines = utils.lineIteratorSize(3100, stdin.reader());
var total: [2]u64 = .{ 0, 0 };
var times: [2]u64 = .{ 0, 0 };
var timer = try std.time.Timer.start();

while (lines.next()) |line| {
times[0] += timer.lap();
const res = scan(line);
total[0] += res[0];
total[1] += res[1];
times[1] += timer.lap();
}
std.debug.print("Program output : {}\n", .{total[0]});
std.debug.print("Withg branching: {}\n", .{total[1]});
std.debug.print("Program output: {:10}\n", .{total[0]});
std.debug.print("With branching: {:10}\n", .{total[1]});
std.debug.print("get next line: {}, part 1 & 2: {}\n", .{ std.fmt.fmtDuration(times[0]), std.fmt.fmtDuration(times[1]) });
}

test "part1" {
Expand Down
10 changes: 10 additions & 0 deletions 2024/04/README.md
Original file line number Diff line number Diff line change
@@ -0,0 +1,10 @@
# Day 4

[Statement](https://adventofcode.com/2024/day/4)

```console
$ zig build --release run < input.txt
Number of 'XMAS' : xxxx
Number of X 'MAS': xxxx
Parse: 567.625us, part1: 686.292us, part2: 288.042us
```
2 changes: 1 addition & 1 deletion 2024/04/build.zig
Original file line number Diff line number Diff line change
Expand Up @@ -2,7 +2,7 @@ const std = @import("std");

pub fn build(b: *std.Build) void {
const target = b.standardTargetOptions(.{});
const optimize = b.standardOptimizeOption(.{});
const optimize = b.standardOptimizeOption(.{ .preferred_optimize_mode = .ReleaseFast });

const utils = b.dependency("utils", .{ .target = target, .optimize = optimize }).module("utils");

Expand Down
6 changes: 6 additions & 0 deletions 2024/04/solve.zig
Original file line number Diff line number Diff line change
Expand Up @@ -128,12 +128,18 @@ pub fn main() !void {
const allocator = gpa.allocator();

var stdin = std.io.bufferedReader(std.io.getStdIn().reader());
var times: [3]u64 = undefined;
var timer = try std.time.Timer.start();

var input = try parse(allocator, stdin.reader());
defer input.deinit();

times[0] = timer.lap();
std.debug.print("Number of 'XMAS' : {:5}\n", .{part1(input)});
times[1] = timer.lap();
std.debug.print("Number of X 'MAS': {:5}\n", .{part2(input)});
times[2] = timer.lap();
std.debug.print("Parse: {}, part1: {}, part2: {}\n", .{ std.fmt.fmtDuration(times[0]), std.fmt.fmtDuration(times[1]), std.fmt.fmtDuration(times[2]) });
}

// -------------------- Tests --------------------
Expand Down
11 changes: 11 additions & 0 deletions 2024/06/README.md
Original file line number Diff line number Diff line change
@@ -0,0 +1,11 @@
# Day 6

[Statement](https://adventofcode.com/2024/day/6)

```console
$ zig build --release run < input.txt
Number of cells visited : xxxx
153.625us
Number of possible loops: xxxx
75.263ms
```

0 comments on commit dc44f24

Please sign in to comment.