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 11, 2024 18:31ZOTTIGZOTTIGScore: 237,231Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 11, 2024 18:31236,6607,838,138,7027,676,863,000132,911,0002,461,696
2Nov 11, 2024 18:31237,2317,856,793,4217,693,723,000134,907,0002,478,080
3Nov 11, 2024 18:31239,7947,948,384,7867,735,330,000177,869,0002,285,568