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 27, 2022 06:38Bernard TeoBernard TeoError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 27, 2022 06:3800000Error: expected "1019492 ", got "bcd5f 382e3c65f8c3a1 8 235929619 3d8d3e 58787a2db9cdc3 16 235929628 302805 404479042c6fa858 21 235929643 39c9d2 6a7e6464e1a6025d 37 235929655 3789b1 6638724a5dfb429d 52 235929660 2dd156 3840687de466b5a9 67 235929669 "