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 22, 2021 16:24Yuriy LyfenkoYuriy LyfenkoScore: 33,589Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 22, 2021 16:2633,3701,165,925,1851,101,217,69902,232,320
2May 22, 2021 16:2433,3811,167,329,4241,101,586,17102,236,416
3May 22, 2021 16:2633,5151,173,527,6521,105,981,13502,232,320
4May 22, 2021 16:2633,5891,173,261,0281,108,442,98402,228,224
5May 22, 2021 16:2433,6191,164,006,0351,109,439,04502,215,936
6May 22, 2021 16:2433,8301,178,401,3781,116,398,37202,232,320