input: from collections import Counter
  
  def find_shortest_anagram_base_length(s: str) -> int:
      """
      Given a string s that is a concatenation of anagrams of some string t, compute the shortest possible length of string t.
  
      Rearranging the letters of a string forms an anagram. For instance, "aab", "aba", and "baa" are anagrams of "aab".
  
      Examples:
      >>> s = "abba"
      2
      >>> s = "cdef"
      4
  
      Constraints:
      1 <= s.length <= 10^5
      s contains only lowercase English letters.
      """
output:     # Write a counter for all characters in the string
      char_count = Counter(s)
      
      # The length of string t would be the count of unique characters in s
      return len(char_count)