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 listJun 25, 2025 01:46Ian MckibbenIan MckibbenScore: 15,271Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 25, 2025 01:4615,149524,053,168417,926,00081,985,0002,306,048
2Jun 25, 2025 01:4615,271526,828,219424,942,00078,989,0002,383,872
3Jun 25, 2025 01:4615,357532,595,132431,819,00074,968,0002,355,200