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 listJul 30, 2024 07:44Павел РатмановПавел РатмановScore: 225,699Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 30, 2024 07:44224,5517,471,426,6247,410,180,76202,232,320
2Jul 30, 2024 07:44225,6997,510,119,1217,448,056,22502,224,128
3Jul 30, 2024 07:44226,1967,536,663,9627,464,459,51502,289,664