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 listAug 9, 2022 19:48Edoardo AnnunziataEdoardo AnnunziataScore: 271,381Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 9, 2022 19:48270,9829,007,168,4788,942,406,37102,252,800
2Aug 9, 2022 19:48271,3819,032,425,3078,955,570,95402,240,512
3Aug 9, 2022 19:48272,5599,049,382,5748,994,450,92502,244,608