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 22, 2024 16:47Павел РатмановПавел РатмановScore: 96,707Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 22, 2024 16:4796,4253,206,628,7742,987,200,000194,817,0002,359,296
2Sep 22, 2024 16:4796,7073,218,864,4663,010,481,000180,848,0002,285,568
3Sep 22, 2024 16:4797,0733,238,767,0233,022,606,000180,797,0002,285,568