input: Write a function in Python that computes the smallest possible length of an original string t from a given string s, which is made up of concatenated anagrams of t. An anagram is a permutation of the characters of a string. For example, "aab", "aba", and "baa" are anagrams of "aab".
  
  Examples:
  >>> s = "abba"
  2
  >>> s = "cdef"
  4
  
  Constraints:
  1 <= len(s) <= 10^5
  s contains only lowercase English letters.
output: def min_original_length(s):
      from collections import Counter
      return sum(Counter(s).values()) // len(set(s))