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 2, 2021 14:17Ilya AniskovetsIlya AniskovetsScore: 42,842Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 2, 2021 14:1742,6231,469,562,9741,406,569,15002,236,416
2Sep 2, 2021 14:1742,8421,488,052,3061,413,787,40502,285,568
3Sep 2, 2021 14:1743,6921,500,649,3451,441,838,79802,174,976