aboutsummaryrefslogtreecommitdiff
path: root/day4.readme
diff options
context:
space:
mode:
authorNathan Lasseter <Nathan Lasseter nathan@bytemark.co.uk>2015-12-07 15:16:10 +0000
committerNathan Lasseter <Nathan Lasseter nathan@bytemark.co.uk>2015-12-07 15:16:10 +0000
commit09cbfeeca74e6b7ca9a9b5d49646c538b8a3f4ba (patch)
treed91f437cc4b676155b7c110b8da8c90995523771 /day4.readme
parent02d64d66b1e3c904b54c19ac2b5e9756d49959fb (diff)
Rearranged into folders, added makefile for convenience.
Diffstat (limited to 'day4.readme')
-rw-r--r--day4.readme14
1 files changed, 0 insertions, 14 deletions
diff --git a/day4.readme b/day4.readme
deleted file mode 100644
index b629160..0000000
--- a/day4.readme
+++ /dev/null
@@ -1,14 +0,0 @@
---- Day 4: The Ideal Stocking Stuffer ---
-
-Santa needs help mining some AdventCoins (very similar to bitcoins) to use as gifts for all the economically forward-thinking little girls and boys.
-
-To do this, he needs to find MD5 hashes which, in hexadecimal, start with at least five zeroes. The input to the MD5 hash is some secret key (your puzzle input, given below) followed by a number in decimal. To mine AdventCoins, you must find Santa the lowest positive number (no leading zeroes: 1, 2, 3, ...) that produces such a hash.
-
-For example:
-
- - If your secret key is abcdef, the answer is 609043, because the MD5 hash of abcdef609043 starts with five zeroes (000001dbbfa...), and it is the lowest such number to do so.
- - If your secret key is pqrstuv, the lowest number it combines with to make an MD5 hash starting with five zeroes is 1048970; that is, the MD5 hash of pqrstuv1048970 looks like 000006136ef....
-
---- Part Two ---
-
-Now find one that starts with six zeroes.