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 listJun 18, 2024 15:35AnSaAnSaScore: 75,309Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 18, 2024 15:3573,8872,499,512,4792,438,275,44202,310,144
2Jun 18, 2024 15:3575,3092,548,076,1082,485,210,69802,301,952
3Jun 18, 2024 15:3575,6012,579,924,4032,494,842,76502,310,144