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 02:13evgenikwtevgenikwtError
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:2200000Wrong answer: expected "1039772 ", got "1039771"
2May 23, 2021 02:1758,3941,994,443,3841,927,005,18202,248,704
3May 23, 2021 02:1758,5662,000,585,5801,932,679,00002,252,800
4May 23, 2021 02:1758,5971,997,162,9811,933,691,39102,244,608
5May 23, 2021 02:1358,6272,010,566,7631,934,683,15302,265,088
6May 23, 2021 02:1359,1672,012,419,6431,952,519,29502,252,800
7May 23, 2021 02:1361,0262,072,747,2412,013,859,56002,248,704