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 22, 2025 17:26Aniruddha DebAniruddha DebScore: 415,778Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 22, 2025 17:26415,31613,735,995,55713,598,495,000106,933,0002,281,472
2Mar 22, 2025 17:26415,77813,757,013,22113,613,746,000106,927,0002,408,448
3Mar 22, 2025 17:26419,72113,885,878,52813,743,877,000106,921,0002,396,160