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 14, 2025 14:03Rajarshi BasuRajarshi BasuScore: 8,204Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 14, 2025 14:038,191298,511,301261,281,0009,009,0002,490,368
2Dec 14, 2025 14:038,204296,038,641260,757,0009,990,0002,359,296
3Dec 14, 2025 14:038,306307,520,950265,094,0009,003,0002,510,848