diff --git a/day-06/Makefile b/day-06/Makefile
new file mode 100644
index 0000000..4ffd562
--- /dev/null
+++ b/day-06/Makefile
@@ -0,0 +1,40 @@
+CC=gcc
+CFLAGS=-Wall
+
+all: clean bin/part01 bin/part02
+	@echo "built all"
+
+run1: clean bin/part01
+	cat data/p01data.txt | bin/part01
+
+run2: clean bin/part02
+	cat data/p02data.txt | bin/part02
+
+test1: clean bin/part01
+	cat data/p01test.txt | bin/part01
+
+test2: clean bin/part02
+	cat data/p02test.txt | bin/part02
+
+bin/part01:
+	$(CC) src/part01.c -o bin/part01 
+
+bin/part02:
+	$(CC) src/part02.c -o bin/part02
+
+.PHONY: clean,pytest1,pytest2,pyrun1,pyrun2
+
+clean:
+	rm -f bin/*
+
+pytest1:
+	cat data/p01test.txt | python3 src/part01.py
+
+pyrun1:
+	cat data/p01data.txt | python3 src/part01.py
+
+pytest2:
+	cat data/p02test.txt | python3 src/part02.py
+
+pyrun2:
+	cat data/p02data.txt | python3 src/part02.py
\ No newline at end of file
diff --git a/day-06/README.md b/day-06/README.md
new file mode 100644
index 0000000..41a7b3f
--- /dev/null
+++ b/day-06/README.md
@@ -0,0 +1,84 @@
+# Day 6: Wait For It
+https://adventofcode.com/2023/day/6
+
+
+The ferry quickly brings you across Island Island. After asking around, you discover that there is indeed normally a large pile of sand somewhere near here, but you don't see anything besides lots of water and the small island where the ferry has docked.
+
+As you try to figure out what to do next, you notice a poster on a wall near the ferry dock. "Boat races! Open to the public! Grand prize is an all-expenses-paid trip to Desert Island!" That must be where the sand comes from! Best of all, the boat races are starting in just a few minutes.
+
+You manage to sign up as a competitor in the boat races just in time. The organizer explains that it's not really a traditional race - instead, you will get a fixed amount of time during which your boat has to travel as far as it can, and you win if your boat goes the farthest.
+
+As part of signing up, you get a sheet of paper (your puzzle input) that lists the **time** allowed for each race and also the best **distance** ever recorded in that race. To guarantee you win the grand prize, you need to make sure you **go farther in each race** than the current record holder.
+
+The organizer brings you over to the area where the boat races are held. The boats are much smaller than you expected - they're actually **toy boats**, each with a big button on top. Holding down the button **charges the boat**, and releasing the button **allows the boat to move**. Boats move faster if their button was held longer, but time spent holding the button counts against the total race time. You can only hold the button at the start of the race, and boats don't move until the button is released.
+
+For example:
+```
+Time:      7  15   30
+Distance:  9  40  200
+```
+This document describes three races:
+
+    The first race lasts 7 milliseconds. The record distance in this race is 9 millimeters.
+    The second race lasts 15 milliseconds. The record distance in this race is 40 millimeters.
+    The third race lasts 30 milliseconds. The record distance in this race is 200 millimeters.
+
+Your toy boat has a starting speed of **zero millimeters per millisecond**. For each whole millisecond you spend at the beginning of the race holding down the button, the boat's speed increases by one millimeter per millisecond.
+
+So, because the first race lasts 7 milliseconds, you only have a few options:
+
++ Don't hold the button at all (that is, hold it for **`0` milliseconds**) at the start of the race. The boat won't move; it will have traveled **`0` millimeters** by the end of the race.
++ Hold the button for **`1` millisecond** at the start of the race. Then, the boat will travel at a speed of `1` millimeter per millisecond for `6` milliseconds, reaching a total distance traveled of **`6` millimeters**.
++ Hold the button for **`2` milliseconds**, giving the boat a speed of `2` millimeters per millisecond. It will then get `5` milliseconds to move, reaching a total distance of 10 millimeters.
++ Hold the button for 3 milliseconds. After its remaining 4 milliseconds of travel time, the boat will have gone 12 millimeters.
++ Hold the button for 4 milliseconds. After its remaining 3 milliseconds of travel time, the boat will have gone 12 millimeters.
++ Hold the button for 5 milliseconds, causing the boat to travel a total of 10 millimeters.
++ Hold the button for 6 milliseconds, causing the boat to travel a total of 6 millimeters.
++ Hold the button for 7 milliseconds. That's the entire duration of the race. You never let go of the button. The boat can't move until you let go of the button. Please make sure you let go of the button so the boat gets to move. 0 millimeters.
+
+Since the current record for this race is 9 millimeters, there are actually 4 different ways you could win: you could hold the button for 2, 3, 4, or 5 milliseconds at the start of the race.
+
+In the second race, you could hold the button for at least 4 milliseconds and at most 11 milliseconds and beat the record, a total of 8 different ways to win.
+
+In the third race, you could hold the button for at least 11 milliseconds and no more than 19 milliseconds and still beat the record, a total of 9 ways you could win.
+
+To see how much margin of error you have, determine the number of ways you can beat the record in each race; in this example, if you multiply these values together, you get 288 (4 * 8 * 9).
+
+Determine the number of ways you could beat the record in each race. What do you get if you multiply these numbers together?
+
+
+
+<details><summary>What do you get if you multiply these numbers together?</summary>
+<p></p>
+<p>
+Your puzzle answer was <code>6209190</code>.
+
+That's the right answer! You are one gold star closer to restoring snow operations.
+</p>
+</details>
+
+## Part Two
+
+As the race is about to start, you realize the piece of paper with race times and record distances you got earlier actually just has very bad kerning. There's really only one race - ignore the spaces between the numbers on each line.
+
+So, the example from before:
+
+Time:      7  15   30
+Distance:  9  40  200
+
+...now instead means this:
+
+Time:      71530
+Distance:  940200
+
+Now, you have to figure out how many ways there are to win this single race. In this example, the race lasts for 71530 milliseconds and the record distance you need to beat is 940200 millimeters. You could hold the button anywhere from 14 to 71516 milliseconds and beat the record, a total of 71503 ways!
+
+
+<details><summary>How many ways can you beat the record in this one much longer race?</summary>
+<p></p>
+<p>
+Your puzzle answer was <code>28545089</code>.
+
+Both parts of this puzzle are complete! They provide two gold stars: **
+</p>
+</details>
diff --git a/day-06/data/p01data.txt b/day-06/data/p01data.txt
new file mode 100644
index 0000000..e81689e
--- /dev/null
+++ b/day-06/data/p01data.txt
@@ -0,0 +1,2 @@
+Time:        40     92     97     90
+Distance:   215   1064   1505   1100
\ No newline at end of file
diff --git a/day-06/data/p01test.txt b/day-06/data/p01test.txt
new file mode 100644
index 0000000..b39f49d
--- /dev/null
+++ b/day-06/data/p01test.txt
@@ -0,0 +1,2 @@
+Time:      7  15   30
+Distance:  9  40  200
\ No newline at end of file
diff --git a/day-06/data/p02data.txt b/day-06/data/p02data.txt
new file mode 100644
index 0000000..e69de29
diff --git a/day-06/data/p02test.txt b/day-06/data/p02test.txt
new file mode 100644
index 0000000..e69de29
diff --git a/day-06/src/part01.c b/day-06/src/part01.c
new file mode 100644
index 0000000..db8ef6a
--- /dev/null
+++ b/day-06/src/part01.c
@@ -0,0 +1,34 @@
+#include <ctype.h>
+#include <stdatomic.h>
+#include <stdio.h>
+#include <stdlib.h>
+#include <string.h>
+
+#define DEBUG
+
+#ifdef DEBUG
+#define debug_printf(...) do{ fprintf( stderr, __VA_ARGS__ ); } while( 0 )
+#else
+#define debug_printf(...) do{ } while ( 0 )
+#endif
+
+#define LINE_MAX 160
+
+int main(int argc, char *argv[]){
+  int linesProcessed = 0;
+  char line[LINE_MAX];
+  
+  while (fgets(line, LINE_MAX, stdin) != NULL) {
+    linesProcessed++;
+  }
+  printf("\n Ingested %d Lines\n", linesProcessed);
+  printf("===================================\n");
+
+  //insert processing code
+
+  printf("\n Processed XXX\n");
+  printf("===================================\n");
+
+
+  printf("Answer: \nXXXX\n");
+}
\ No newline at end of file
diff --git a/day-06/src/part01.py b/day-06/src/part01.py
new file mode 100644
index 0000000..e1f8471
--- /dev/null
+++ b/day-06/src/part01.py
@@ -0,0 +1,78 @@
+import sys
+from dataclasses import dataclass, field
+from collections import namedtuple
+
+DEBUG = True
+debug_padding = 24
+
+def debug_print(printname, *args):
+    if DEBUG:
+        print(f"{'DEBUG::'+printname:<{debug_padding}}", *args)
+
+
+RaceParams = namedtuple("Point", "time distance")
+
+
+
+print("Parsing Input:")
+print("")
+print("===================================\n");
+
+FILENAME = "/home/icaema/Public/advent-of-code/day-06/data/p01data.txt"
+f = open(FILENAME, "r")
+
+#for line in sys.stdin:
+lines = f.readlines()
+p_time = lines[0][5:].split()
+p_farthest = lines[1][9:].split()
+
+races = [RaceParams(int(p_time[i]), int(p_farthest[i])) for i in range(len(p_time))]
+
+
+
+def calc_distance(totaltime, sleeptime):
+    return (totaltime-sleeptime)*sleeptime
+
+
+
+def invcalc_distance(totaltime, distance):
+    return (totaltime + distance*distance)/distance
+
+result = 1
+
+for race in races:
+    winning_sleeptimes = 0
+    for i in range(race.time):
+        if calc_distance(race.time, i) < race.distance:
+            winning_sleeptimes += 1
+    winning_sleeptimes = len([slt for slt in range(race.time) if calc_distance(race.time, slt) > race.distance])
+    print(winning_sleeptimes)
+    result *= winning_sleeptimes
+
+
+
+
+
+print("")
+print(" Proccessing:")
+print("===================================\n");
+# Insert Processing Code
+
+
+
+
+
+
+print("")
+print(" Calculate Answer:")
+print("===================================\n");
+
+
+
+
+
+
+print("")
+print(" Answer:")
+print("===================================\n");
+print(f"Answer: \n{result}");
\ No newline at end of file
diff --git a/day-06/src/part02.c b/day-06/src/part02.c
new file mode 100644
index 0000000..db8ef6a
--- /dev/null
+++ b/day-06/src/part02.c
@@ -0,0 +1,34 @@
+#include <ctype.h>
+#include <stdatomic.h>
+#include <stdio.h>
+#include <stdlib.h>
+#include <string.h>
+
+#define DEBUG
+
+#ifdef DEBUG
+#define debug_printf(...) do{ fprintf( stderr, __VA_ARGS__ ); } while( 0 )
+#else
+#define debug_printf(...) do{ } while ( 0 )
+#endif
+
+#define LINE_MAX 160
+
+int main(int argc, char *argv[]){
+  int linesProcessed = 0;
+  char line[LINE_MAX];
+  
+  while (fgets(line, LINE_MAX, stdin) != NULL) {
+    linesProcessed++;
+  }
+  printf("\n Ingested %d Lines\n", linesProcessed);
+  printf("===================================\n");
+
+  //insert processing code
+
+  printf("\n Processed XXX\n");
+  printf("===================================\n");
+
+
+  printf("Answer: \nXXXX\n");
+}
\ No newline at end of file
diff --git a/day-06/src/part02.py b/day-06/src/part02.py
new file mode 100644
index 0000000..75c3bd3
--- /dev/null
+++ b/day-06/src/part02.py
@@ -0,0 +1,73 @@
+import sys
+from dataclasses import dataclass, field
+from collections import namedtuple
+
+DEBUG = True
+debug_padding = 24
+
+def debug_print(printname, *args):
+    if DEBUG:
+        print(f"{'DEBUG::'+printname:<{debug_padding}}", *args)
+
+
+
+
+print("Parsing Input:")
+print("")
+print("===================================\n");
+
+FILENAME = "/home/icaema/Public/advent-of-code/day-06/data/p01data.txt"
+f = open(FILENAME, "r")
+
+#for line in sys.stdin:
+lines = f.readlines()
+p_time = lines[0][5:].replace(' ', '').split()
+p_farthest = lines[1][9:].replace(' ', '').split()
+debug_print("input", f"ptime: {p_farthest}, p_farthest: {p_farthest}")
+
+races = [(int(p_time[i]), int(p_farthest[i])) for i in range(len(p_time))]
+
+debug_print("races", races)
+
+
+result = 1
+
+for race in races:
+    winning_sleeptimes = len([slt for slt in range(race[0]) if (race[0]-slt)*slt > race[1]])
+    print(winning_sleeptimes)
+    result *= winning_sleeptimes
+
+#for race in races:
+#    #winning_sleeptimes = 0
+#    less_count = 0
+#    sleepTime = 1
+#    while calc_distance(race.time, sleepTime) < race.distance:
+#        less_count += 1
+#        sleepTime += 1
+#    result *= race.time - less_count*2 -1
+
+
+
+print("")
+print(" Proccessing:")
+print("===================================\n");
+# Insert Processing Code
+
+
+
+
+
+
+print("")
+print(" Calculate Answer:")
+print("===================================\n");
+
+
+
+
+
+
+print("")
+print(" Answer:")
+print("===================================\n");
+print(f"Answer: \n{result}");
\ No newline at end of file
diff --git a/day-06/working.tmp b/day-06/working.tmp
new file mode 100644
index 0000000..c6d6e08
--- /dev/null
+++ b/day-06/working.tmp
@@ -0,0 +1,3 @@
+0mm/ms
+each 1ms hold += 1mm/ms
+