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 16, 2024 13:41Huy Duc LeHuy Duc LeScore: 134,217Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 16, 2024 13:41133,9654,481,182,5694,420,848,06202,248,704
2Feb 16, 2024 13:41134,2174,488,217,2784,429,167,08002,269,184
3Feb 16, 2024 13:41135,4744,542,203,5754,470,634,09602,260,992