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 17, 2022 15:55Franek KortaFranek KortaError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 17, 2022 15:5400000Error: expected "1025160 ", got "1025159"stderr
2Dec 17, 2022 15:5400000Error: expected "1021400 ", got "1021399"stderr
3Dec 17, 2022 15:5520,815739,524,750686,896,82902,228,224
4Dec 17, 2022 15:5520,845758,297,627687,889,64202,220,032
5Dec 17, 2022 15:5520,912748,326,004690,105,36802,265,088