Logs Aggregator

package SetsAndMaps3;

import java.util.Scanner;
import java.util.TreeMap;
import java.util.TreeSet;

public class LogsAggregator {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);


        int n = Integer.parseInt(scanner.nextLine());

        TreeMap<String, Integer> users = new TreeMap<>();
        TreeMap<String, TreeSet<String>> addresses = new TreeMap<>();

        while (n-- > 0) {
            String[] tokens = scanner.nextLine().split("\\s+");

            String ip = tokens[0];
            String name = tokens[1];
            int time = Integer.parseInt(tokens[2]);

            if (!users.containsKey(name)) {
                users.put(name, time);
                addresses.put(name, new TreeSet<>() {{
                    add(ip);
                }});
            } else {
                users.put(name, users.get(name) + time);
                addresses.get(name).add(ip);
            }
        }

        users.forEach((key, value) -> {

            System.out.printf("%s: %d %s%n", key, value, addresses.get(key).toString());
        });
    }
}