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 22, 2024 12:07Павел РатмановПавел РатмановScore: 106,529Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 22, 2024 12:07106,2823,537,840,4263,153,686,000353,628,0002,285,568
2Sep 22, 2024 12:07106,5293,547,780,5793,195,770,000319,676,0002,285,568
3Sep 22, 2024 12:07106,6673,553,832,3833,187,295,000332,717,0002,285,568