Duplicate Insert Error Handler

Problem Context

In DB2 database programming with COBOL, SQLCODE -803 indicates a duplicate key violation — you attempted to INSERT a row that would violate a unique constraint or primary key on a table. Handling this gracefully is critical in enterprise batch processing systems where records may be re-processed or feeds may contain duplicates.

You are tasked with simulating the logic of a COBOL DB2 error handler. Given a list of database INSERT operations (each represented as a record ID), your program must simulate what happens when duplicates are encountered and return the final state of the database table along with an operation log.

Task

Given a list of integer record IDs representing attempted INSERT operations into a unique-key database table, simulate the DB2 insert behavior:

• If a record ID has not been inserted yet, insert it (SQLCODE = 0, success).
• If a record ID already exists, simulate SQLCODE -803 (duplicate key error), skip the insert, and log the error.

Return two things:

1. The sorted list of successfully inserted record IDs (final table state).
2. The count of -803 duplicate errors encountered.

Input Format

A single list of integers operations representing record IDs to be inserted, in order.

Output Format

Return a tuple/pair: (sorted list of unique inserted IDs, count of duplicate errors).

Examples

Example 1

Input: operations = [101, 202, 303, 101, 404, 202] Output: ([101, 202, 303, 404], 2) Explanation:

• INSERT 101 → success (SQLCODE = 0)
• INSERT 202 → success (SQLCODE = 0)
• INSERT 303 → success (SQLCODE = 0)
• INSERT 101 → SQLCODE -803 (duplicate!)
• INSERT 404 → success (SQLCODE = 0)
• INSERT 202 → SQLCODE -803 (duplicate!)
• Final table: [101, 202, 303, 404], Errors: 2

Example 2

Input: operations = [1, 2, 3, 4, 5] Output: ([1, 2, 3, 4, 5], 0) Explanation: All inserts are unique, no -803 errors occur.

Example 3

Input: operations = [7, 7, 7, 7] Output: ([7], 3) Explanation: First insert succeeds, the next three all trigger SQLCODE -803.

Approach Hints

• Think about what data structure efficiently tracks "already inserted" records — a Hash Set gives O(1) lookup.
• Iterate through operations in order, checking for membership before "inserting".