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 2, 2021 14:18Ilya AniskovetsIlya AniskovetsScore: 42,396Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 2, 2021 14:1842,2161,465,892,0091,393,132,23702,199,552
2Sep 2, 2021 14:2042,2801,467,068,9591,395,245,56302,248,704
3Sep 2, 2021 14:2042,3931,464,813,7251,398,982,59902,306,048
4Sep 2, 2021 14:2042,3961,456,294,0351,399,055,89402,228,224
5Sep 2, 2021 14:1843,0361,485,498,2731,420,197,72902,269,184
6Sep 2, 2021 14:1843,5231,495,734,7991,436,259,72102,174,976