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 listDec 31, 2025 08:02Aman | अमनAman | अमनScore: 322,893Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 31, 2025 08:02321,67810,646,805,11610,572,405,00042,973,0002,498,560
2Dec 31, 2025 08:02322,89310,689,696,12310,596,511,00058,963,0002,318,336
3Dec 31, 2025 08:02324,65610,750,667,73610,672,693,00040,971,0002,363,392