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 listSep 28, 2021 17:10Ilya AniskovetsIlya AniskovetsError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 28, 2021 17:1000000Error: expected "1020892 ", got "0 2536 169820 2061557 2314985 2317991 2312363 2309573 2329050 2311006 2310780 2316771 2311225 2317627 2308120 2306596 "
2Sep 28, 2021 17:1400000Error: expected "1024628 ", got "0 2672 170734 2060223 2311515 2311102 2318290 2307833 2323372 2301598 2312825 2314094 2313603 2314576 2322430 2315133 "
3Sep 28, 2021 17:1600000Error: expected "1022140 ", got "0 2727 170674 2060685 2307173 2315841 2294047 2324340 2320154 2315951 2307355 2315417 2310501 2322457 2309470 2323208 "