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 25, 2022 16:20Bernard 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 25, 2022 16:2000000Error: expected "1023919 ", got "1023918"
2Aug 25, 2022 16:2600000Error: expected "1019592 ", got "1019591"
3Aug 25, 2022 16:2616,973632,123,426560,114,18702,277,376
4Aug 25, 2022 16:2716,993621,794,109560,764,66402,273,280
5Aug 25, 2022 16:2717,024617,492,754561,791,46902,277,376
6Aug 25, 2022 16:2717,104621,386,616564,446,72802,289,664
7Aug 25, 2022 16:2617,109628,482,754564,585,68702,281,472
8Aug 25, 2022 16:2618,019657,775,417594,630,38702,281,472