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 listNov 26, 2024 21:36MatthiasMatthiasScore: 111,089Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 26, 2024 21:36110,9233,687,679,6613,610,519,00049,951,0002,281,472
2Nov 26, 2024 21:36111,0893,700,127,2403,614,978,00050,943,0002,351,104
3Nov 26, 2024 21:36111,5513,712,798,5813,624,234,00056,940,0002,387,968