Unique strings v2 Sergey Svistunov

Same problem as Unique strings, but with 3 CPUs available and scoring based on wall time instead of CPU time.

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 29, 2022 17:37Bernard 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 29, 2022 17:3700000Error: expected "1020231 ", got "1020230"
2Aug 29, 2022 17:3700000Error: expected "1021543 ", got "1021542"
3Aug 29, 2022 17:377,410222,303,701160,353,18402,412,544
4Aug 29, 2022 17:377,535226,045,148159,350,42102,314,240
5Aug 29, 2022 17:377,557226,713,514160,747,04402,301,952