diff --git a/12/build.zig b/12/build.zig
new file mode 100644
index 0000000..b79aff7
--- /dev/null
+++ b/12/build.zig
@@ -0,0 +1,67 @@
+const std = @import("std");
+
+// Although this function looks imperative, note that its job is to
+// declaratively construct a build graph that will be executed by an external
+// runner.
+pub fn build(b: *std.Build) void {
+    // Standard target options allows the person running `zig build` to choose
+    // what target to build for. Here we do not override the defaults, which
+    // means any target is allowed, and the default is native. Other options
+    // for restricting supported target set are available.
+    const target = b.standardTargetOptions(.{});
+
+    // Standard optimization options allow the person running `zig build` to select
+    // between Debug, ReleaseSafe, ReleaseFast, and ReleaseSmall. Here we do not
+    // set a preferred release mode, allowing the user to decide how to optimize.
+    const optimize = b.standardOptimizeOption(.{});
+
+    const exe = b.addExecutable(.{
+        .name = "12",
+        .root_source_file = b.path("src/main.zig"),
+        .target = target,
+        .optimize = optimize,
+    });
+
+    // This declares intent for the executable to be installed into the
+    // standard location when the user invokes the "install" step (the default
+    // step when running `zig build`).
+    b.installArtifact(exe);
+
+    // This *creates* a Run step in the build graph, to be executed when another
+    // step is evaluated that depends on it. The next line below will establish
+    // such a dependency.
+    const run_cmd = b.addRunArtifact(exe);
+
+    // By making the run step depend on the install step, it will be run from the
+    // installation directory rather than directly from within the cache directory.
+    // This is not necessary, however, if the application depends on other installed
+    // files, this ensures they will be present and in the expected location.
+    run_cmd.step.dependOn(b.getInstallStep());
+
+    // This allows the user to pass arguments to the application in the build
+    // command itself, like this: `zig build run -- arg1 arg2 etc`
+    if (b.args) |args| {
+        run_cmd.addArgs(args);
+    }
+
+    // This creates a build step. It will be visible in the `zig build --help` menu,
+    // and can be selected like this: `zig build run`
+    // This will evaluate the `run` step rather than the default, which is "install".
+    const run_step = b.step("run", "Run the app");
+    run_step.dependOn(&run_cmd.step);
+
+    const exe_unit_tests = b.addTest(.{
+        .root_source_file = b.path("src/main.zig"),
+        .target = target,
+        .optimize = optimize,
+    });
+
+    const run_exe_unit_tests = b.addRunArtifact(exe_unit_tests);
+    run_exe_unit_tests.has_side_effects = true;
+
+    // Similar to creating the run step earlier, this exposes a `test` step to
+    // the `zig build --help` menu, providing a way for the user to request
+    // running the unit tests.
+    const test_step = b.step("test", "Run unit tests");
+    test_step.dependOn(&run_exe_unit_tests.step);
+}
diff --git a/12/build.zig.zon b/12/build.zig.zon
new file mode 100644
index 0000000..e41d46f
--- /dev/null
+++ b/12/build.zig.zon
@@ -0,0 +1,72 @@
+.{
+    // This is the default name used by packages depending on this one. For
+    // example, when a user runs `zig fetch --save <url>`, this field is used
+    // as the key in the `dependencies` table. Although the user can choose a
+    // different name, most users will stick with this provided value.
+    //
+    // It is redundant to include "zig" in this name because it is already
+    // within the Zig package namespace.
+    .name = "12",
+
+    // This is a [Semantic Version](https://semver.org/).
+    // In a future version of Zig it will be used for package deduplication.
+    .version = "0.0.0",
+
+    // This field is optional.
+    // This is currently advisory only; Zig does not yet do anything
+    // with this value.
+    //.minimum_zig_version = "0.11.0",
+
+    // This field is optional.
+    // Each dependency must either provide a `url` and `hash`, or a `path`.
+    // `zig build --fetch` can be used to fetch all dependencies of a package, recursively.
+    // Once all dependencies are fetched, `zig build` no longer requires
+    // internet connectivity.
+    .dependencies = .{
+        // See `zig fetch --save <url>` for a command-line interface for adding dependencies.
+        //.example = .{
+        //    // When updating this field to a new URL, be sure to delete the corresponding
+        //    // `hash`, otherwise you are communicating that you expect to find the old hash at
+        //    // the new URL.
+        //    .url = "https://example.com/foo.tar.gz",
+        //
+        //    // This is computed from the file contents of the directory of files that is
+        //    // obtained after fetching `url` and applying the inclusion rules given by
+        //    // `paths`.
+        //    //
+        //    // This field is the source of truth; packages do not come from a `url`; they
+        //    // come from a `hash`. `url` is just one of many possible mirrors for how to
+        //    // obtain a package matching this `hash`.
+        //    //
+        //    // Uses the [multihash](https://multiformats.io/multihash/) format.
+        //    .hash = "...",
+        //
+        //    // When this is provided, the package is found in a directory relative to the
+        //    // build root. In this case the package's hash is irrelevant and therefore not
+        //    // computed. This field and `url` are mutually exclusive.
+        //    .path = "foo",
+
+        //    // When this is set to `true`, a package is declared to be lazily
+        //    // fetched. This makes the dependency only get fetched if it is
+        //    // actually used.
+        //    .lazy = false,
+        //},
+    },
+
+    // Specifies the set of files and directories that are included in this package.
+    // Only files and directories listed here are included in the `hash` that
+    // is computed for this package. Only files listed here will remain on disk
+    // when using the zig package manager. As a rule of thumb, one should list
+    // files required for compilation plus any license(s).
+    // Paths are relative to the build root. Use the empty string (`""`) to refer to
+    // the build root itself.
+    // A directory listed here means that all files within, recursively, are included.
+    .paths = .{
+        "build.zig",
+        "build.zig.zon",
+        "src",
+        // For example...
+        //"LICENSE",
+        //"README.md",
+    },
+}
diff --git a/12/src/main.zig b/12/src/main.zig
new file mode 100644
index 0000000..0cdaa15
--- /dev/null
+++ b/12/src/main.zig
@@ -0,0 +1,269 @@
+// wow! i am bad at code. shitty day i just wanted it to Work
+// awful way to do it especially in part 2 what was i even doing
+
+const std = @import("std");
+
+var arena = std.heap.ArenaAllocator.init(std.heap.page_allocator);
+const alloc = arena.allocator();
+
+const test_data = @embedFile("test");
+const input_data = @embedFile("input");
+
+pub fn main() !void {
+    const stdout = std.io.getStdOut().writer();
+
+    const value1 = try run1(input_data);
+    try stdout.print("{d}\n", .{value1});
+
+    const value2 = try run2(input_data);
+    try stdout.print("{d}\n", .{value2});
+}
+
+test "test input part 1" {
+    std.debug.print("\n", .{});
+    const value = try run1(test_data);
+    std.debug.print("{d}\n", .{value});
+    try std.testing.expectEqual(1930, value);
+}
+
+test "test input part 2" {
+    std.debug.print("\n",.{});
+    const value = try run2(test_data);
+    std.debug.print("{d}\n", .{value});
+    try std.testing.expectEqual(1206, value);
+}
+
+fn parseIntFromReader(reader: anytype) anyerror!u64 {
+    const f = try reader.readByte();
+    if (f < '0' or f > '9') return error.BadCharacter;
+    var v: u64 = f - '0';
+    while (true) {
+        const c = try reader.readByte();
+        if (c < '0' or c > '9') {
+            break;
+        } else {
+            v = (v * 10) + (c - '0');
+        }
+    }
+    return v;
+}
+
+var r2map: [256][256]u8 = [_][256]u8{[_]u8{0}**256}**256;
+var r2done: [256][256]u8 = [_][256]u8{[_]u8{0}**256}**256;
+var r2edges: [256][256]u8 = [_][256]u8{[_]u8{0}**256}**256;
+var r2dim: usize = undefined;
+fn run2_r(y: usize, x: usize) void {
+    const c = r2map[y][x];
+    r2done[y][x] = 1;
+    
+    if (y > 0 and r2map[y-1][x] == c) {
+        if (r2done[y-1][x] == 0) run2_r(y-1, x);
+    } else {
+        r2edges[y][x] |= 0b1;
+    }
+    
+    if (x > 0 and r2map[y][x-1] == c) {
+        if (r2done[y][x-1] == 0) run2_r(y, x-1);
+    } else {
+        r2edges[y][x] |= 0b10;
+    }
+    
+    if (y < r2dim-1 and r2map[y+1][x] == c) {
+        if (r2done[y+1][x] == 0) run2_r(y+1, x);
+    } else {
+        r2edges[y][x] |= 0b100;
+    }
+    
+    if (x < r2dim-1 and r2map[y][x+1] == c) {
+        if (r2done[y][x+1] == 0) run2_r(y, x+1);
+    } else {
+        r2edges[y][x] |= 0b1000;
+    }
+}
+fn run2_r2(y: usize, x: usize, area: *u64, perimeter: *u64) void {
+    const c = r2map[y][x];
+    r2done[y][x] = 2;
+    area.* += 1;
+
+    // top edge
+    if (r2edges[y][x] & 0b1 != 0) {
+        perimeter.* += 1;
+        var ix = x;
+        while (ix >= 0) : (ix -= 1) {
+            if (r2map[y][ix] != c) break;
+            if (r2edges[y][ix] & 0b1 == 0) break;
+            r2edges[y][ix] &= ~@as(u8,0b1);
+            if (ix == 0) break;
+        }
+        ix = x+1;
+        while (ix < r2dim) : (ix += 1) {
+            if (r2map[y][ix] != c) break;
+            if (r2edges[y][ix] & 0b1 == 0) break;
+            r2edges[y][ix] &= ~@as(u8,0b1);
+        }
+    }
+
+    // bottom edge
+    if (r2edges[y][x] & 0b100 != 0) {
+        perimeter.* += 1;
+        var ix = x;
+        while (ix >= 0) : (ix -= 1) {
+            if (r2map[y][ix] != c) break;
+            if (r2edges[y][ix] & 0b100 == 0) break;
+            r2edges[y][ix] &= ~@as(u8,0b100);
+            if (ix == 0) break;
+        }
+        ix = x+1;
+        while (ix < r2dim) : (ix += 1) {
+            if (r2map[y][ix] != c) break;
+            if (r2edges[y][ix] & 0b100 == 0) break;
+            r2edges[y][ix] &= ~@as(u8,0b100);
+        }
+    }
+
+    // left edge
+    if (r2edges[y][x] & 0b10 != 0) {
+        perimeter.* += 1;
+        var iy = y;
+        while (iy >= 0) : (iy -= 1) {
+            if (r2map[iy][x] != c) break;
+            if (r2edges[iy][x] & 0b10 == 0) break;
+            r2edges[iy][x] &= ~@as(u8,0b10);
+            if (iy == 0) break;
+        }
+        iy = y+1;
+        while (iy < r2dim) : (iy += 1) {
+            if (r2map[iy][x] != c) break;
+            if (r2edges[iy][x] & 0b10 == 0) break;
+            r2edges[iy][x] &= ~@as(u8,0b10);
+        }
+    }
+
+    // right edge
+    if (r2edges[y][x] & 0b1000 != 0) {
+        perimeter.* += 1;
+        var iy = y;
+        while (iy >= 0) : (iy -= 1) {
+            if (r2map[iy][x] != c) break;
+            if (r2edges[iy][x] & 0b1000 == 0) break;
+            r2edges[iy][x] &= ~@as(u8,0b1000);
+            if (iy == 0) break;
+        }
+        iy = y+1;
+        while (iy < r2dim) : (iy += 1) {
+            if (r2map[iy][x] != c) break;
+            if (r2edges[iy][x] & 0b1000 == 0) break;
+            r2edges[iy][x] &= ~@as(u8,0b1000);
+        }
+    }
+
+    if (y > 0 and r2map[y-1][x] == c) {
+        if (r2done[y-1][x] == 1) run2_r2(y-1, x, area, perimeter);
+    }
+
+    if (x > 0 and r2map[y][x-1] == c) {
+        if (r2done[y][x-1] == 1) run2_r2(y, x-1, area, perimeter);
+    }
+
+    if (y < r2dim-1 and r2map[y+1][x] == c) {
+        if (r2done[y+1][x] == 1) run2_r2(y+1, x, area, perimeter);
+    }
+
+    if (x < r2dim-1 and r2map[y][x+1] == c) {
+        if (r2done[y][x+1] == 1) run2_r2(y, x+1, area, perimeter);
+    }
+}
+
+fn run2(input: []const u8) !u64 {
+    var lines = std.mem.splitScalar(u8, input, '\n');
+
+    { 
+        var y: usize = 0;
+        while (lines.next()) |line| {
+            if (std.mem.eql(u8, line, "")) continue;
+            std.mem.copyForwards(u8, &r2map[y], line);
+            std.debug.print("{s}\n",.{line});
+            r2dim = line.len;
+            y += 1;
+        }
+    }
+
+    std.debug.print("map max {}\n", .{r2dim});
+
+    var total: u64 = 0;
+    for (0..r2dim) |y| {
+        for (0..r2dim) |x| {
+            if (r2done[y][x] > 0) continue;
+            run2_r(y, x);
+            var area: u64 = 0;
+            var perimeter: u64 = 0;
+            run2_r2(y, x, &area, &perimeter);
+            total += area * perimeter;
+        }
+    }
+
+    return total;
+}
+
+var r1map: [256][256]u8 = [_][256]u8{[_]u8{0}**256}**256;
+var r1done: [256][256]u8 = [_][256]u8{[_]u8{0}**256}**256;
+var r1dim: usize = undefined;
+fn run1_r(y: usize, x: usize, area: *u64, perimeter: *u64) void {
+    const c = r1map[y][x];
+    area.* += 1;
+    r1done[y][x] = 1;
+    
+    if (y > 0 and r1map[y-1][x] == c) {
+        if (r1done[y-1][x] == 0) run1_r(y-1, x, area, perimeter);
+    } else {
+        perimeter.* += 1;
+    }
+    
+    if (x > 0 and r1map[y][x-1] == c) {
+        if (r1done[y][x-1] == 0) run1_r(y, x-1, area, perimeter);
+    } else {
+        perimeter.* += 1;
+    }
+    
+    if (y < r1dim-1 and r1map[y+1][x] == c) {
+        if (r1done[y+1][x] == 0) run1_r(y+1, x, area, perimeter);
+    } else {
+        perimeter.* += 1;
+    }
+    
+    if (x < r1dim-1 and r1map[y][x+1] == c) {
+        if (r1done[y][x+1] == 0) run1_r(y, x+1, area, perimeter);
+    } else {
+        perimeter.* += 1;
+    }
+}
+
+fn run1(input: []const u8) !u64 {
+    var lines = std.mem.splitScalar(u8, input, '\n');
+
+    { 
+        var y: usize = 0;
+        while (lines.next()) |line| {
+            if (std.mem.eql(u8, line, "")) continue;
+            std.mem.copyForwards(u8, &r1map[y], line);
+            std.debug.print("{s}\n",.{line});
+            r1dim = line.len;
+            y += 1;
+        }
+    }
+
+    std.debug.print("map max {}\n", .{r1dim});
+
+    var total: u64 = 0;
+    for (0..r1dim) |y| {
+        for (0..r1dim) |x| {
+            if (r1done[y][x] == 1) continue;
+            var area: u64 = 0;
+            var perimeter: u64 = 0;
+            run1_r(y, x, &area, &perimeter);
+            total += area * perimeter;
+        }
+    }
+
+    return total;
+}