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:12E SequeiraE SequeiraScore: 93,684Success
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:1293,3533,109,054,9063,052,653,00027,987,0002,387,968
2Nov 23, 2024 15:1293,6843,120,701,5953,069,572,00021,989,0002,310,144
3Nov 23, 2024 15:1295,4473,184,500,4373,128,775,00020,978,0002,486,272