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 listDec 31, 2025 20:34Павел РатмановПавел РатмановScore: 92,168Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 31, 2025 20:3491,7733,054,390,7522,985,558,00042,964,0002,519,040
2Dec 31, 2025 20:3492,1683,067,454,7203,007,572,00033,983,0002,281,472
3Dec 31, 2025 20:3492,9823,096,444,8673,035,410,00032,982,0002,281,472