Making event order repeatable

Offsets, replayed IDs and timestamp ties need clear rules before an event-ordering task can be judged.

Compare instants, not timestamp strings

Two timestamp strings can describe the same instant using different offsets. The event-ordering example parses each timestamp and converts it to UTC before comparing it. A timestamp without an offset is rejected because the brief requires an unambiguous time.

Define what counts as a replay

The same event ID, event type and instant count as one event, even when the timestamp text differs. If the same ID arrives with a conflicting type or instant, the implementation raises an error instead of silently picking one version.

Make ties predictable

Sorting only by time leaves tied events dependent on their input order. This task uses the event ID as the second sort key. That rule makes the output consistent when the same batch is reordered.

Check the task as well as the solution

The verifier covers equivalent offsets, conflicts, missing fields, microsecond precision and input permutations. An empty implementation is used as a negative control. These are finite checks of a batch-processing exercise, not a claim about a production streaming system.

Based on a Clorvin Labs internal demonstration. No client work or model performance is represented.