advent-of-code-2022 VS advent-of-code-2022

My current solution (in Common Lisp) solves both of those (hopefully correctly!)

https://github.com/alecigne/advent-of-code https://github.com/astynax/adventofcode2022.lisp https://github.com/aximili-dev/aoc-2022 https://github.com/blake-watkins/advent-of-code-2022 https://github.com/dawranliou/advent-of-code/ https://github.com/dmgk/aoc-2022 https://github.com/jackie-jackie/AoC https://github.com/leolaporte/aoc-cl https://github.com/leozamboni/aoc-2022 https://github.com/michaeldelago/aoc-2022 https://github.com/omarbassam88/aoc2022-cl https://github.com/poesraven8628/AdventofCode2022 https://github.com/Quiescent/advent-of-code-2022-in-common-lisp https://github.com/ryukinix/adventofcode/ https://github.com/staudtlex/advent-of-code-2022 https://github.com/taDachs/aoc-2022-lisp/tree/main/6 https://github.com/wsgac/advent-of-code-2022 https://github.com/xvan/adventofcode-2022 https://github.com/xxmyc/advent-of-code-2022-common-lisp https://github.com/ZachFontenot/adventofcode

I'm posting my solutions on the advent of code solution megathread each day, but here's the github link to them too https://github.com/blake-watkins/advent-of-code-2022

Common Lisp 3139 / 2967

Common Lisp 2468/2489

nice one! you can make it even faster by creating a compile time multiplication table as i have done here, so all that happens at runtime is the bucketing of similarly aged fish, 7 multiplications + a sum

you've still got some overhead in your code, my rust solution creates a dense lookup array at runtime & takes ~200us on my 10850k. are you including file IO and printing to stdout?

code

full solution