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 listNov 14, 2025 22:41Aniruddha DebAniruddha DebScore: 15,846Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 14, 2025 22:4115,839553,553,690466,819,00055,858,0002,490,368
2Nov 14, 2025 22:4115,846554,039,312470,040,00052,892,0002,428,928
3Nov 14, 2025 22:4116,046558,810,305478,557,00050,952,0002,367,488