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 05:34Andrew EpsteinAndrew EpsteinScore: 1,503Success
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 05:381,47844,354,758101,725,0001,222,0002,162,688stderr
2Oct 31, 2026 05:381,48944,672,101102,635,0001,263,0002,170,880stderr
3Oct 31, 2026 05:381,49344,813,714103,395,0001,012,0002,170,880stderr
4Oct 31, 2026 05:381,50045,019,825103,797,0001,261,0002,162,688stderr
5Oct 31, 2026 05:381,50345,096,915104,020,0001,232,0002,170,880stderr
6Oct 31, 2026 05:381,51145,343,997103,882,0002,008,0002,162,688stderr
7Oct 31, 2026 05:381,51345,406,342105,159,0001,164,0002,170,880stderr
8Oct 31, 2026 05:381,51445,439,970105,107,0001,167,0002,162,688stderr
9Oct 31, 2026 05:381,54046,213,085107,291,0001,204,0002,162,688stderr