Why is collections.Counter much slower than ''.count?

Counter() allows you to count any hashable objects, not just substrings. Both solutions are O(n) -time. Your measurements show that the overhead of iterating and hashing individual characters by Counter() is greater than running s.count() 4 times.

The Counter class inherits from dict, while string. Count is the following C-implementation (CPython 3.3).

I cant really gove you an answer,but what I can give you is a way to a solution, that is you have to find the anglde that you relate to or peaks your interest. A good paper is one that people get drawn into because it reaches them ln some way.As for me WW11 to me, I think of the holocaust and the effect it had on the survivors, their families and those who stood by and did nothing until it was too late.