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 listMar 23, 2025 14:28Aniruddha DebAniruddha DebScore: 35,044Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 23, 2025 14:2834,8371,177,125,1201,110,633,00038,987,0002,510,848
2Mar 23, 2025 14:2835,0441,178,189,8291,114,462,00041,979,0002,449,408
3Mar 23, 2025 14:2835,0951,186,825,0511,118,115,00040,004,0002,269,184