Unique strings v2 Sergey Svistunov

Same problem as Unique strings, but with 3 CPUs available and scoring based on wall time instead of CPU time.

Count the exact number of unique tokens as fast as possible.

Input

One token per line on STDIN:

JWXcKKaWzvFL5
Rof
3ztCpA
5wHcGN
*UiEMthaTS*g

Output

Print the exact count of unique tokens to STDOUT.

Constraints

  • Character set: 0123456789abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ@#%*
  • Maximum token length: 16
  • Approximately 1,000,000 unique tokens
Back to listOct 31, 2026 10:18Andrew EpsteinAndrew EpsteinScore: 1,557Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 31, 2026 10:221,54346,318,352100,635,0002,041,0002,191,360stderr
2Oct 31, 2026 10:221,54446,337,660100,562,0002,015,0002,179,072stderr
3Oct 31, 2026 10:221,55346,596,385101,446,0002,008,0002,187,264stderr
4Oct 31, 2026 10:221,55546,665,279101,776,0002,034,0002,179,072stderr
5Oct 31, 2026 10:221,55746,715,633101,988,0002,049,0002,179,072stderr
6Oct 31, 2026 10:221,56146,830,635102,387,0002,061,0002,179,072stderr
7Oct 31, 2026 10:221,57147,143,472102,723,0002,019,0002,179,072stderr
8Oct 31, 2026 10:221,57847,351,449103,963,0002,050,0002,183,168stderr
9Oct 31, 2026 10:222,06561,972,601110,460,0002,153,0002,179,072stderr