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 08:49Andrew EpsteinAndrew EpsteinScore: 1,476Success
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 08:541,44043,216,73198,088,0001,178,0002,170,880stderr
2Oct 31, 2026 08:541,45143,533,23999,352,0001,105,0002,170,880stderr
3Oct 31, 2026 08:541,46944,073,002100,783,0001,128,0002,170,880stderr
4Oct 31, 2026 08:541,47544,250,801101,373,0001,187,0002,170,880stderr
5Oct 31, 2026 08:541,47644,281,114101,784,0001,106,0002,170,880stderr
6Oct 31, 2026 08:541,47844,351,861101,744,0001,121,0002,170,880stderr
7Oct 31, 2026 08:541,48144,440,310101,785,0001,130,0002,170,880stderr
8Oct 31, 2026 08:541,48444,520,380102,329,0001,024,0002,170,880stderr
9Oct 31, 2026 08:541,49744,911,677103,282,0001,102,0002,162,688stderr