(defn distance [[x0 y0 z0] [x1 y1 z1]]
  (+ (Math/abs (- x0 x1))
     (Math/abs (- y0 y1))
     (Math/abs (- z0 z1))))

"Elapsed time: 9046.938164 msecs"

(defn distance [[x0 y0 z0] [x1 y1 z1]]
  (+ (Math/abs ^long (- x0 x1))
     (Math/abs ^long (- y0 y1))
     (Math/abs ^long (- z0 z1))))

"Elapsed time: 291.773856 msecs"

I made the same discovery on the same function…

(defn distance [p1 p2] (reduce + (map #(Math/abs ^int (- %1 %2)) p1 p2)))

This was day25 where there’s a 4th dimensions and the numbers were low. I guess long is probably better in general, and spliting out the operations would also give a speed up

was optimizing and cleaning up arjuns 23-2 solution here and there: https://github.com/arjun27/advent-of-code-clojure/blob/master/src/advent/2018/day23.clj https://github.com/akovantsev/adventofcode/blob/master/src/adventofcode/2018/day23_2.clj

@norman you can (defn distance [^ints p1 ^ints p2] there

c++ guys are laughing at us

Performance wise? On peak performance on some of the exercises the JVM might be faster.