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 28, 2022 08:23Bernard TeoBernard TeoScore: 10,794Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 28, 2022 08:2310,354404,085,220341,687,42802,232,320
2Aug 28, 2022 08:2310,439403,963,023344,502,49302,236,416
3Aug 28, 2022 08:2310,449396,188,277344,810,58502,236,416
4Aug 28, 2022 08:2310,481407,639,824345,881,75302,224,128
5Aug 28, 2022 08:2310,794418,798,396356,211,27102,240,512
6Aug 28, 2022 08:2310,817424,878,291356,948,73702,236,416
7Aug 28, 2022 08:2310,845421,597,497357,871,67402,240,512
8Aug 28, 2022 08:2310,878451,407,116358,972,69902,240,512
9Aug 28, 2022 08:2310,888433,595,136359,306,47402,240,512