set meine_Liste to {1, 1, 1, 2, 2, 3, 1, 2, 3, 3, 1, 2, 1, 1, 3, 2, 4, 4, 6, 5, 6, 5, 4, 5, 2, 5, 1, 4, 1, 2} as list 
set meine_Liste2 to {} as list 
 
repeat with i from 1 to count of meine_Liste 
    set mein_Item to item i of meine_Liste 
    if mein_Item is not in meine_Liste2 then set end of meine_Liste2 to mein_Item 
end repeat 
 
 
repeat with akt_Zahl in meine_Liste2 
    set Zaehler to 0 
    set akt_Zahl to akt_Zahl as string 
    repeat with j from 1 to count of meine_Liste 
        set mein_Item to item j of meine_Liste 
        set mein_Item to mein_Item as string 
        if akt_Zahl = mein_Item then 
            set Zaehler to Zaehler + 1 
            beep 1 
        end if 
    end repeat 
    display dialog "Die Seite: " & akt_Zahl & " ist " & Zaehler & "-mal vorhanden!" 
end repeat 

set meine_Liste to {1, 1, 1, 2, 2, 3, 1, 2, 3, 3, 1, 2, ¬ 
  1, 1, 3, 2, 4, 4, 6, 5, 6, 5, 4, 5, 2, 5, 1, 4, 1, 2} 
set meine_Liste2 to {} 
 
repeat with i from 1 to count of meine_Liste 
  set mein_Item to item i of meine_Liste 
  if mein_Item is not in meine_Liste2 then 
    set end of meine_Liste2 to mein_Item 
  end if 
end repeat 
 
set nItems to count meine_Liste2 
set meine_Liste2 to (quickSort(meine_Liste2, 1, nItems)) 
 
repeat with i from 1 to nItems 
  set akt_Zahl to item i of meine_Liste2 
  set Zaehler to 0 
  repeat with j from 1 to count meine_Liste 
    if akt_Zahl is (item j of meine_Liste) then 
      set Zaehler to Zaehler + 1 
    end if 
  end repeat 
  display dialog "Die Seite " & akt_Zahl & ¬ 
    " ist " & Zaehler & "-mal vorhanden!" 
end repeat 
 
on quickSort(a, L, R) 
  script 
    property aList : a 
  end script 
  tell result 
    set ctr to L 
    set n to R 
    set aRef to item L of its aList 
    repeat while ctr < n 
      repeat while (aRef < item n of its aList) and (ctr < n) 
        set n to n - 1 
      end repeat 
      if n is not ctr then 
        set item ctr of its aList to item n of its aList 
        set ctr to ctr + 1 
      end if 
      repeat while (aRef > item ctr of its aList) and (ctr < n) 
        set ctr to ctr + 1 
      end repeat 
      if n is not ctr then 
        set item n of its aList to item ctr of its aList 
        set n to n - 1 
      end if 
    end repeat 
    set item n of its aList to aRef 
    if L < n then 
      quickSort(its aList, L, n - 1) 
    end if 
    if R > ctr then 
      quickSort(its aList, ctr + 1, R) 
      return its aList 
    end if 
  end tell 
end quickSort 

Methode Hans:  Zwischen 140 und 160 Millisekunden.  
Methode Holgi: Zwischen 360 und 380 Millisekunden. 

set t1 to get GetMilliSec 
 
set meineListe1 to {1, 1, 1, 2, 2, 3, 1, 2, 3, 3, 1, 2, ¬ 
  1, 1, 3, 2, 4, 4, 6, 5, 6, 5, 4, 5, 2, 5, 1, 4, 1, 2} 
 
set nItems1 to count meineListe1 
set meineListe2 to {} 
 
repeat with i from 1 to nItems1 
  set meinItem to item i of my meineListe1 
  if meinItem is not in meineListe2 then 
    set end of meineListe2 to meinItem 
  end if 
end repeat 
 
set nItems2 to count meineListe2 
set meineListe2 to (quickSort(meineListe2, 1, nItems2)) 
 
repeat with i from 1 to nItems2 
  set aktZahl to item i of meineListe2 
  set Zaehler to 0 
  repeat with j from 1 to nItems1 
    if aktZahl is (item j of my meineListe1) then 
      set Zaehler to Zaehler + 1 
    end if 
  end repeat 
  --  display dialog "Die Seite " & aktZahl & ¬ 
  " ist " & Zaehler & "-mal vorhanden!" 
end repeat 
 
set t2 to get GetMilliSec 
display dialog "" & (t2 - t1) & " Millisekunden" 
 
on quickSort(a, L, R) 
  script 
    property aList : a 
  end script 
  tell result 
    set ctr to L 
    set n to R 
    set aRef to item L of its aList 
    repeat while ctr < n 
      repeat while (aRef < item n of its aList) and (ctr < n) 
        set n to n - 1 
      end repeat 
      if n is not ctr then 
        set item ctr of its aList to item n of its aList 
        set ctr to ctr + 1 
      end if 
      repeat while (aRef > item ctr of its aList) and (ctr < n) 
        set ctr to ctr + 1 
      end repeat 
      if n is not ctr then 
        set item n of its aList to item ctr of its aList 
        set n to n - 1 
      end if 
    end repeat 
    set item n of its aList to aRef 
    if L < n then 
      quickSort(its aList, L, n - 1) 
    end if 
    if R > ctr then 
      quickSort(its aList, ctr + 1, R) 
      return its aList 
    end if 
  end tell 
end quickSort