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 29, 2022 01:59woodsy-sounding-wilful-sapwoodwoodsy-sounding-wilful-sapwoodScore: 464,531Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 29, 2022 01:59462,99115,333,286,87915,278,686,50002,195,456
2Sep 29, 2022 01:59464,53115,387,951,95315,329,510,12802,220,032
3Sep 29, 2022 01:59465,67815,429,947,38115,367,376,47802,199,552