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 23, 2024 15:11E SequeiraE SequeiraScore: 94,584Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 23, 2024 15:1194,4783,148,280,6713,095,776,00021,984,0002,281,472
2Nov 23, 2024 15:1194,5843,152,166,5733,098,308,00022,980,0002,387,968
3Nov 23, 2024 15:1195,0493,166,598,9153,113,626,00022,982,0002,387,968