Return the k most frequent event IDs from an unbounded stream at any point, with bounded memory.

State the data model and invariants first, choose a structure that gives the required operations their target complexity, and keep correctness separate from optimization. Implement the smallest working version before adding concurrency, persistence, or scale.

Test empty input, one-element input, duplicates, boundary indices, invalid states, and the largest allowed size; state time and space complexity.