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 21, 2022 17:58Bernard TeoBernard TeoScore: 21,313Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 21, 2022 17:5121,184774,039,619699,070,50502,248,704
2Aug 21, 2022 18:0521,203759,275,995699,705,08302,252,800
3Aug 21, 2022 18:0521,258775,245,506701,514,42402,179,072
4Aug 21, 2022 18:0521,295771,270,733702,748,74002,236,416
5Aug 21, 2022 17:5821,313768,691,773703,316,94502,244,608
6Aug 21, 2022 17:5121,324767,363,537703,678,72402,244,608
7Aug 21, 2022 17:5821,350770,548,092704,542,68702,248,704
8Aug 21, 2022 17:5121,364782,478,845704,997,53902,252,800
9Aug 21, 2022 17:5821,418772,922,055706,790,62302,244,608