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 23, 2021 00:22evgenikwtevgenikwtError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 23, 2021 02:0600000Wrong answer: expected "1037281 ", got "1037280"
2May 23, 2021 00:2263,7762,180,210,4662,104,603,38002,240,512
3May 23, 2021 00:2265,3042,219,756,5102,155,032,66102,248,704
4May 23, 2021 00:2265,6582,227,803,5972,166,725,88202,244,608