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 listAug 30, 2021 12:10Vitaliy F.Vitaliy F.Score: 54,878Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 30, 2021 12:1054,7841,865,071,2431,807,885,57002,244,608
2Aug 30, 2021 12:1054,8781,879,104,5631,810,966,48102,236,416
3Aug 30, 2021 12:1055,7091,918,606,1081,838,403,50902,224,128