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 listDec 11, 2022 19:20Franek KortaFranek KortaScore: 57,672Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 11, 2022 19:1957,4081,964,593,0121,894,449,60602,220,032
2Dec 11, 2022 19:2057,4141,948,680,2641,894,660,24402,220,032
3Dec 11, 2022 19:1957,6351,961,431,2811,901,964,07902,224,128
4Dec 11, 2022 19:2057,6721,956,318,7991,903,166,96802,215,936
5Dec 11, 2022 19:1957,9601,975,204,6301,912,685,76602,215,936
6Dec 11, 2022 19:2057,9791,975,301,9301,913,308,27702,211,840