3 milliseconds, man, the C optimizers blow my mind, they basically just cheat and stick the answer in there. :-) [C]cat sum.c #include <stdio.h> int main(void) { unsigned long long sum = 0, i; for (i = 0; i <=…
No expert, but from the source it looks like it just uses whatever a 'map' uses to match keys: (defn frequencies "Returns a map from distinct items in coll to the number of times they appear." {:added "1.2" :static…
3 milliseconds, man, the C optimizers blow my mind, they basically just cheat and stick the answer in there. :-) [C]cat sum.c #include <stdio.h> int main(void) { unsigned long long sum = 0, i; for (i = 0; i <=…
No expert, but from the source it looks like it just uses whatever a 'map' uses to match keys: (defn frequencies "Returns a map from distinct items in coll to the number of times they appear." {:added "1.2" :static…