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:29Andrew EpsteinAndrew EpsteinScore: 1,472Success
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:311,43342,992,35697,650,0001,159,0002,170,880stderr
2Oct 31, 2026 07:311,44043,222,08997,985,0001,129,0002,170,880stderr
3Oct 31, 2026 07:311,45043,502,16898,680,0001,147,0002,170,880stderr
4Oct 31, 2026 07:311,46744,038,630100,409,0001,207,0002,170,880stderr
5Oct 31, 2026 07:311,47244,166,849100,656,0001,193,0002,162,688stderr
6Oct 31, 2026 07:311,47244,162,64298,353,0003,037,0002,170,880stderr
7Oct 31, 2026 07:311,48444,539,193102,146,0001,205,0002,162,688stderr
8Oct 31, 2026 07:311,50145,055,312103,735,0001,112,0002,170,880stderr
9Oct 31, 2026 07:311,53946,186,658106,888,0001,019,0002,170,880stderr