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 17:11Павел РатмановПавел РатмановScore: 96,601Success
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 17:1196,3083,204,649,0343,009,308,000168,848,0002,281,472
2Sep 22, 2024 17:1196,6013,217,619,6873,009,002,000178,821,0002,424,832
3Sep 22, 2024 17:1196,7113,224,546,5532,996,623,000194,845,0002,375,680