Racing Results

Unfortunately, the database containing all this year's racing results has crashed. The only thing left is a backup of database records and results for each race. We urgently need to know who is the winner!
Your program will receive input as a list of elements in the form of [race, racer_name, position], where all elements are integers:
race is a database record number between 2001 and 2000+N where N is the total number of races in the championship.
racer_name is a database record number between 1001 and 1000+R where R is the total number of racers participating.
position is a value between 1 (won the race) and R (arrived last).
Points are given according to the racers' position in a race: the 1st position is worth 10 points, 2nd is worth 6 points, 3rd is 4 points, 4th is 3 points, 5th is 2 points and 6th is worth 1 point. Positions further down earn no points.
In case of an equal number of points at the end of the championship, the winner is the racer with the lowest record number. There are at most 100 racers, and at most 100 races in the championship.
Your program is expected to output the record number of the winner, followed by how many points he or she got.

Function
findWinner(results: int[][]) → int[]
Complete the function findWinner in the editor.
findWinner has the following parameter:
int[][] results: a 2D array of integers where each element is an array of the form [race, racer_name, position]
Returns
int[]: an array of two integers where the first element is the record number of the winner and the second element is the number of points they got

Examples
Example 1
results = [[2001, 1001, 3], [2001, 1002, 2], [2002, 1003, 1], [2002, 1001, 2], [2002, 1002, 3], [2001, 1003, 1]]
return = [1003, 20]
The two races are coded 2001 and 2002. The racers with records 1001, 1002 and 1003 competed. Based on the raw results, they have the following points:
Racer 1001: 4+6=10 (3rd and 2nd positions)
Racer 1002: 6+4=10 (2nd and 3rd positions)
Racer 1003: 10+10=20 (1st in both races)
Your program is expected to output the following line in that case:
1003 20

The trick is a hash map (or a plain array, since racers are 1001 to 1100) keyed by racer id, adding points per row. Points come from a fixed table: 10, 6, 4, 3, 2, 1, and zero for anything past 6th. Don't sort the whole input or group by race, you don't need to. The race number is noise. The common pitfall is the tiebreaker. When two racers have equal points, the lower record number wins, so compare points first, then id. Iterate in ascending id order and only replace the best on strictly greater points, or use an explicit tie check. Another trap is returning the points instead of [id, points], or forgetting positions beyond 6 score nothing. It's O(n) time. If your mind goes blank mid-OA, StealthCoder is the hedge that hands you this loop while you stay in the editor.

Memorize the pattern. If you can't, run StealthCoder. The proctor sees the IDE. They don't see what's behind it.