How many integers from 1 to 10000 can be written as the product of two (not necessarily distinct) primes?

PrimeProductProblem.hs

import Data.List
import Data.Numbers.Primes

maxValue :: Int
maxValue = 10^5

uniqOrdered :: [Int] -> [Int]
uniqOrdered = map head . group . sort

possiblePrimes :: [Int]
possiblePrimes = takeWhile (< div maxValue 2) primes

primeProducts :: [Int]
primeProducts = uniqOrdered [p1 * p2 | p1 <- possiblePrimes, p2 <- possiblePrimes, p1 * p2 < maxValue]

main :: IO ()
main = print . length $ primeProducts