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 5, 2026 18:35Павел РатмановПавел РатмановScore: 68,437Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 5, 2026 18:3568,4162,291,922,5112,234,754,00022,976,0002,437,120
2Jan 5, 2026 18:3568,4372,288,306,5922,234,450,00023,972,0002,420,736
3Jan 5, 2026 18:3568,4882,295,925,2982,236,135,00023,969,0002,404,352