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:31Bernard 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:3100000Error: expected "1022739 ", got "0 0 901010101010102 90a0b0c0d0e0f11 1020304050f 1020304050f f 0 235929602 0 0 901010101010102 90a0b0c0d0e0f11 1020304050f 1020304050f f 0 235929602 0 0 901010101010102 90a0b0c0d0e0f11 1020304050f 1020304050f f 0 2359296...