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 listJul 12, 2025 16:43Aniruddha DebAniruddha DebScore: 518,114Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 12, 2025 16:43517,39517,115,638,83816,945,129,000128,909,0002,510,848
2Jul 12, 2025 16:43518,11417,141,978,16116,994,835,000102,926,0002,416,640
3Jul 12, 2025 16:43519,58317,191,512,68317,028,326,000117,912,0002,469,888