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 listSep 2, 2021 09:59Ilya AniskovetsIlya AniskovetsScore: 126,473Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 2, 2021 09:59125,8894,211,820,7584,154,350,62602,244,608
2Sep 2, 2021 09:59126,4734,254,657,5894,173,623,93002,203,648
3Sep 2, 2021 09:59126,9824,261,739,7744,190,402,25602,236,416