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 20, 2025 16:50Rajarshi BasuRajarshi BasuScore: 5,269Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 20, 2025 16:505,232200,049,380165,661,0006,985,0002,519,040
2Dec 20, 2025 16:505,269195,489,087169,868,0003,996,0002,514,944
3Dec 20, 2025 16:505,280201,815,690168,245,0006,008,0002,510,848