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 19, 2025 15:28Rajarshi BasuRajarshi BasuScore: 9,832Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 19, 2025 15:289,437338,567,820306,428,0004,990,0002,506,752
2Dec 19, 2025 15:289,832355,212,301320,475,0003,993,0002,338,816
3Dec 19, 2025 15:2810,994387,559,011356,794,0005,996,0002,486,272