Distinct Value Counter

This project implements an efficient algorithm to count distinct integers from user input using a Bloom Filter-inspired approach with multiple hash functions. Instead of storing all numbers explicitly, it uses a bit array and three different hash functions to determine if a number has been seen before.

Key Features:

Optimized Memory Usage: Uses a bit array instead of a full list to reduce space complexity.

Fast Lookup: Utilizes three custom hash functions to quickly check for duplicates.

Error Handling: Ensures users input only valid integer values.

Dynamic Input Handling: Accepts a user-defined number of inputs for flexibi