Day 1: 58 bytes of Haskell. 48 bytes of Python. I suspect Haskell will amortize better on more complex tasks. Half the difference here was requiring main= in the Haskell code, and it has a much more concise lambda syntax.
[edit]
My initial C implementation also came in at 58 bytes, however I got it down to 38 bytes under a reasonable interpretation of the rules. I also managed an implementation in 1 byte of C under an IOCCC-esque interpretation of the rules.
[edit]
I got my Haskell implementation down to 54 bytes while writing up my readme. Discussion with Tari in sax got it down to 46, which beats even my python implementation. I'm submitting both versions, but for sake of fairness I don't expect the graders to necessarily include it.
[edit]
My initial C implementation also came in at 58 bytes, however I got it down to 38 bytes under a reasonable interpretation of the rules. I also managed an implementation in 1 byte of C under an IOCCC-esque interpretation of the rules.
[edit]
I got my Haskell implementation down to 54 bytes while writing up my readme. Discussion with Tari in sax got it down to 46, which beats even my python implementation. I'm submitting both versions, but for sake of fairness I don't expect the graders to necessarily include it.
