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 07:56Aman | अमनAman | अमनScore: 322,410Success
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 07:56321,20010,630,413,77910,551,619,00047,970,0002,400,256
2Dec 31, 2025 07:56322,41010,676,960,00310,591,552,00047,970,0002,502,656
3Dec 31, 2025 07:56323,59110,718,982,14910,633,523,00044,968,0002,490,368