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 listNov 24, 2022 08:47Gaussian-ProcessGaussian-ProcessScore: 50,492Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 24, 2022 08:4750,4901,751,523,1551,666,159,57602,256,896
2Nov 24, 2022 08:4750,4921,748,674,6081,666,230,36902,285,568
3Nov 24, 2022 08:4750,7501,744,369,5821,674,744,02902,211,840