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 listFeb 4, 2024 01:50SandSandScore: 355,019Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 4, 2024 01:50354,10411,740,540,89211,685,424,04502,297,856
2Feb 4, 2024 01:50355,01911,780,528,76711,715,617,81502,252,800
3Feb 4, 2024 01:50356,45911,830,511,81911,763,145,18802,252,800