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:27Павел РатмановПавел РатмановScore: 250,320Success
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:27236,3157,832,029,2767,765,423,00032,967,000241,664
2Jan 5, 2026 14:27250,3208,297,981,8418,216,615,00043,955,000217,088
3Jan 5, 2026 14:27252,6118,380,415,7768,289,232,00046,944,000188,416