Unique strings Sergey Svistunov

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 listJan 8, 2026 03:02Josu San MartinJosu San MartinScore: 29,732Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 8, 2026 03:0229,5861,003,314,129965,341,00010,992,0002,289,664
2Jan 8, 2026 03:0229,7321,008,581,413971,165,0009,991,0002,289,664
3Jan 8, 2026 03:0230,2061,026,719,285987,816,0008,989,0002,289,664