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 listOct 31, 2026 07:48Andrew EpsteinAndrew EpsteinScore: 1,484Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 31, 2026 07:511,46143,852,916100,718,0001,200,0002,150,400stderr
2Oct 31, 2026 07:511,46944,075,406101,631,0001,010,0002,154,496stderr
3Oct 31, 2026 07:511,47244,188,864101,948,0001,140,0002,154,496stderr
4Oct 31, 2026 07:511,47444,246,549101,541,0001,285,0002,154,496stderr
5Oct 31, 2026 07:511,48444,530,486103,228,0001,019,0002,150,400stderr
6Oct 31, 2026 07:511,49344,810,934103,887,0001,037,0002,170,880stderr
7Oct 31, 2026 07:511,52345,718,494101,776,0001,015,0002,150,400stderr
8Oct 31, 2026 07:511,54846,469,906103,562,0001,203,0002,150,400stderr
9Oct 31, 2026 07:511,55146,554,439103,581,0001,012,0002,162,688stderr