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 25, 2021 18:45Yuriy LyfenkoYuriy LyfenkoScore: 18,197Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 25, 2021 18:4517,762627,568,437586,146,65502,244,608
2May 25, 2021 18:4517,788656,120,370587,008,53802,232,320
3May 25, 2021 18:4517,835644,169,130588,567,65302,224,128
4May 25, 2021 18:4518,197661,369,695600,511,18002,236,416
5May 25, 2021 18:4518,238658,021,547601,863,72002,240,512
6May 25, 2021 18:4518,261677,271,148602,600,95402,236,416