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 17, 2025 23:03Aniruddha DebAniruddha DebScore: 19,456Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 17, 2025 23:0319,307661,702,727629,129,0008,001,0002,392,064
2Jun 17, 2025 23:0319,315667,326,822633,396,0003,996,0002,506,752
3Jun 17, 2025 23:0319,421664,692,584634,883,0005,998,0002,531,328
4Jun 17, 2025 23:0319,439662,711,945633,486,0007,993,0002,396,160
5Jun 17, 2025 23:0319,456660,733,732636,042,0006,000,0002,486,272
6Jun 17, 2025 23:0319,464670,705,647638,308,0003,995,0002,387,968
7Jun 17, 2025 23:0319,497670,527,666635,401,0007,992,0002,269,184
8Jun 17, 2025 23:0319,628668,877,505642,727,0004,997,0002,338,816
9Jun 17, 2025 23:0320,313692,098,628664,325,0005,993,0002,269,184