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 11, 2025 12:04Rajarshi BasuRajarshi BasuScore: 140,711Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 11, 2025 12:04139,3304,628,939,8064,573,922,00023,978,0002,392,064
2Dec 11, 2025 12:04140,7114,669,650,9584,616,470,00026,979,0002,523,136
3Dec 11, 2025 12:04141,2884,691,829,3534,636,529,00025,974,0002,412,544