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 4, 2026 21:29Павел РатмановПавел РатмановScore: 92,520Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 4, 2026 21:2992,2293,073,675,8403,009,590,00033,972,0002,289,664
2Jan 4, 2026 21:2992,5203,080,039,7963,020,192,00032,980,0002,506,752
3Jan 4, 2026 21:2993,5103,114,021,5223,054,856,00030,978,0002,289,664