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 13, 2025 16:23Rajarshi BasuRajarshi BasuScore: 17,167Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 13, 2025 16:2317,130590,566,888545,318,00019,975,0002,424,832
2Dec 13, 2025 16:2317,167593,100,675546,536,00019,983,0002,482,176
3Dec 13, 2025 16:2317,512602,906,702558,922,00018,963,0002,469,888