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 listJan 8, 2026 20:14Павел РатмановПавел РатмановScore: 41,253Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 8, 2026 20:1440,9081,378,973,6941,338,986,00010,991,0002,478,080
2Jan 8, 2026 20:1441,2531,384,912,5221,347,368,00013,993,0002,523,136
3Jan 8, 2026 20:1441,6931,401,215,2771,364,876,00010,990,0002,498,560