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 22, 2025 04:58Ian MckibbenIan MckibbenScore: 19,545Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 22, 2025 04:5819,513672,196,637556,943,00086,991,0002,285,568
2Jun 22, 2025 04:5819,545669,456,643565,996,00078,999,0002,306,048
3Jun 22, 2025 04:5819,604668,845,340560,939,00085,990,0002,326,528