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 28, 2023 12:44АндрейАндрейError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 28, 2023 12:4400000Error: Exit with code 2: unexpected fault address 0xc02d212764 fatal error: fault [signal SIGSEGV: segmentation violation code=0x1 addr=0xc02d212764 pc=0x56035ae4c550] goroutine 1 [running]: runtime.throw({0x56035ae4d32c?, 0xff000000000000?}) /tmp/go...stderr