anchor.diff:    ;; Given that the three characters are always asked for in order, analyse
     ;; the file so as to determine the shortest possible secret passcode of
     ;; unknown length.
  -  (let ((attempts (-<> "data/79-keylog.txt"
  +  (let ((attempts (-<> "data/079-keylog.txt"
                       read-all-from-file
                       (mapcar #'digits <>)
                       (mapcar (rcurry #'coerce 'vector) <>))))
  
positive.code:     (* 28433 <>)
      1+
      (mod <> (expt 10 10))))
  
  (defun problem-145 ()
    ;; Some positive integers n have the property that the sum [ n + reverse(n) ]
  
negative.code:              (sum word :key #'letter-number))
             (triangle-word-p (word)
               (trianglep (word-value word))))
      (count-if #'triangle-word-p (parse-strings-file "data/042-words.txt"))))
  
  (defun problem-43 ()
    ;; The number, 1406357289, is a 0 to 9 pandigital number because it is made up
  