Here's my solution to Project Euler problem sixteen, written in Clojure. I'm a bit offended by most of the solutions in the message thread because they require bignum support, which is basically a pathetically easy way to solve this problem.

(defn carry [coll]
    (reverse
     (loop [c coll extra 0 acc '()]
       (if (nil? c)
         (if (zero? extra) acc (cons 1 acc))
         (let [v (+ extra (first c))]
           (recur (next c) (int (/ v 10)) (cons (mod v 10) acc)))))))
  
  (defn dbl [coll]
    (carry (map (partial * 2) coll)))

  (defn eul-16 [iters]
    (reduce + 0
            (loop [n 0 acc '(1)]
              (if (= n iters)
                acc
                (recur (inc n) (dbl acc))))))

  (eul-16 1000)

Consider for a moment this ad:

Want to avoid Android phones filled with pointless shovel-ware, over-branding, and gratuitous UI “innovations”? Get Google's Android phone, the one that maybe doesn't suck. If I couldn't use AT&T’s network—say because I lived in the burbs—or otherwise couldn’t get an iPhone, this ad might make me thing, “Huh, maybe there’s hope that my experience with this phone won’t too closely resemble trying to surf Verizon’s black and red walled-garden subset of the web on a Motorola RAZR circa 2002.”