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 23, 2025 09:58Rajarshi BasuRajarshi BasuScore: 4,882Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 23, 2025 09:584,875184,980,261157,894,0002,997,0002,445,312
2Dec 23, 2025 09:584,882185,218,439157,103,0004,002,0002,322,432
3Dec 23, 2025 09:584,888184,292,507157,292,0004,007,0002,514,944