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 listMay 5, 2021 12:58Yurkov AlekseyYurkov AlekseyError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 5, 2021 12:5800000Wrong answer: expected: 1037892 got: 0=0|80204, 1=1714|80056, 2=112791|85056, 3=1799177|150079, 4=2067604|160265, 5=2060478|160192, 6=2080807|160640, 7=2079607|161400, 8=2070417|0, 9=2063094|0, 10=2079022|0, 11=2071971|0, 12=2064179|0, 13=2067997|0, ...