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 11, 2025 16:11Rajarshi BasuRajarshi BasuScore: 84,674Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 11, 2025 16:1182,5132,750,002,4592,702,967,00019,977,0002,375,680
2Dec 11, 2025 16:1184,6742,825,076,0832,775,263,00018,967,0002,379,776
3Dec 11, 2025 16:1184,8362,837,481,2472,774,649,00024,951,0002,519,040