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 14:23Павел РатмановПавел РатмановScore: 172,545Success
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 14:23171,4035,683,467,2235,625,334,00030,974,000188,416
2Jan 5, 2026 14:23172,5455,721,346,2175,662,017,00031,971,000188,416
3Jan 5, 2026 14:23173,7785,767,999,6795,702,702,00031,964,000188,416