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:57Ian MckibbenIan MckibbenScore: 19,579Success
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:5719,481664,705,277559,891,00082,983,0002,539,520
2Jun 22, 2025 04:5619,545669,570,908552,978,00091,996,0002,473,984
3Jun 22, 2025 04:5619,554671,031,297561,381,00083,907,0002,281,472
4Jun 22, 2025 04:5719,579667,674,895554,237,00091,873,0002,289,664
5Jun 22, 2025 04:5719,588672,234,579562,475,00083,921,0002,285,568
6Jun 22, 2025 04:5619,833677,427,618568,559,00085,933,0002,486,272