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 listSep 21, 2024 13:54Alex KentAlex KentScore: 132,896Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 21, 2024 13:54132,5164,401,396,5354,354,036,00018,991,0002,478,080
2Sep 21, 2024 13:54132,8964,414,638,4894,365,579,00019,988,0002,281,472
3Sep 21, 2024 13:54133,6874,444,135,0364,395,691,00015,991,0002,281,472