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 listMar 12, 2025 18:36Aniruddha DebAniruddha DebScore: 150,510Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 12, 2025 18:25148,7084,935,716,6454,898,379,0008,991,0002,416,640
2Mar 12, 2025 18:36149,7434,967,632,3854,931,534,0009,990,0002,449,408
3Mar 12, 2025 18:25149,8004,976,636,9924,932,412,00010,989,0002,506,752
4Mar 12, 2025 18:37150,1404,985,997,4354,941,628,00012,985,0002,416,640
5Mar 12, 2025 18:37150,5104,993,654,4784,952,841,00013,985,0002,355,200
6Mar 12, 2025 18:36150,7655,007,881,5124,971,260,0003,996,0002,281,472
7Mar 12, 2025 18:25150,9775,009,733,8874,975,245,0006,993,0002,478,080
8Mar 12, 2025 18:36151,6615,031,624,5174,996,817,0007,990,0002,338,816
9Mar 12, 2025 18:37152,0105,048,433,5235,007,340,0008,991,0002,281,472