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 listJul 1, 2021 16:28Igor ShekalevIgor ShekalevScore: 133,783Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 1, 2021 16:28133,0554,471,592,9514,390,803,75302,289,664
2Jul 1, 2021 16:13133,5694,470,142,5534,407,775,66802,265,088
3Jul 1, 2021 16:13133,7264,469,742,0594,412,955,87002,240,512
4Jul 1, 2021 16:28133,7834,485,207,5494,414,849,44402,273,280
5Jul 1, 2021 16:28135,0384,528,694,7054,456,268,59102,236,416
6Jul 1, 2021 16:13135,3144,532,555,6554,465,346,61502,236,416