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 13:04Yurkov 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 13:0400000Wrong answer: expected: 1037374 got: , 6=2073345|80340, 7=2061493|79878, 8=2070972|80343, 9=2070731|80255, 10=2080036|80541, 11=2066553|80026, 12=2081291|80667, 13=2056907|79770, 14=2070642|80300, 15=2070966|80279, 16=0|0