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 26, 2022 17:47Bernard TeoBernard TeoScore: 10,272Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 26, 2022 17:4710,237403,424,598337,811,83102,285,568
2Aug 26, 2022 17:4810,251397,230,785338,280,95702,273,280
3Aug 26, 2022 17:4810,258404,784,741338,510,19202,277,376
4Aug 26, 2022 17:4810,262400,214,289338,640,65802,281,472
5Aug 26, 2022 17:4710,272409,819,454338,979,81502,273,280
6Aug 26, 2022 17:4810,275412,648,043339,061,12002,289,664
7Aug 26, 2022 17:4710,306404,750,217340,083,79402,285,568
8Aug 26, 2022 17:4810,317411,025,997340,460,86802,285,568
9Aug 26, 2022 17:4810,345406,450,683341,381,68102,277,376