Approximating unique string occurrences using a small, fixed amount of memory
Your problem is known as the count-distinct problem. The Wikipedia page describes some of the algorithms which have been designed for this problem.