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 22, 2025 09:24Rajarshi BasuRajarshi BasuScore: 6,775Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 22, 2025 09:246,684246,578,822216,570,0003,992,0002,347,008
2Dec 22, 2025 09:246,775253,351,334215,585,0007,984,0002,506,752
3Dec 22, 2025 09:246,794252,765,551219,195,0005,004,0002,510,848