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 listDec 2, 2023 12:42Vitaliy KamalinVitaliy KamalinScore: 313,866Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 2, 2023 12:42309,34610,280,114,66710,208,415,34002,338,816
2Dec 2, 2023 12:42313,86610,413,590,04510,357,570,42002,330,624
3Dec 2, 2023 12:42315,74610,484,353,47510,419,634,13902,359,296