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 listNov 25, 2021 00:25Kirill ButinKirill ButinError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 25, 2021 00:2200000Error: expected "1021234 ", got "1021233 "
2Nov 25, 2021 00:2400000Error: expected "1024714 ", got "1024713 "
3Nov 25, 2021 00:25133,3194,462,836,8154,399,516,96102,236,416
4Nov 25, 2021 00:25133,7044,475,273,6544,412,244,66102,236,416
5Nov 25, 2021 00:25134,0184,491,762,7364,422,580,47502,236,416