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 19, 2025 15:29Rajarshi BasuRajarshi BasuScore: 7,793Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 19, 2025 15:297,783283,406,899250,839,0005,996,0002,510,848
2Dec 19, 2025 15:297,793286,151,344251,157,0006,003,0002,281,472
3Dec 19, 2025 15:297,842284,362,644253,793,0004,995,0002,281,472