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 5, 2021 06:16Yuriy LyfenkoYuriy LyfenkoScore: 19,496Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 5, 2021 06:1819,140705,141,276631,620,18502,244,608
2May 5, 2021 06:1819,437691,173,911641,410,24802,236,416
3May 5, 2021 06:1619,495720,074,551643,334,51302,236,416
4May 5, 2021 06:1619,496708,932,663643,356,05602,248,704
5May 5, 2021 06:1819,506718,507,272643,694,12502,248,704
6May 5, 2021 06:1619,535703,007,304644,660,92902,236,416