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 21, 2025 05:03Rajarshi BasuRajarshi BasuScore: 5,131Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 21, 2025 05:035,092193,790,221163,024,0005,000,0002,301,952
2Dec 21, 2025 05:035,131194,594,090165,306,0004,007,0002,514,944
3Dec 21, 2025 05:035,136196,968,836163,481,0006,017,0002,510,848