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:00Andrew EpsteinAndrew EpsteinScore: 1,501Success
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:041,47744,312,095100,255,0001,194,0002,162,688stderr
2Oct 31, 2026 08:041,48544,552,804101,553,0001,020,0002,170,880stderr
3Oct 31, 2026 08:041,48744,630,293101,293,0001,010,0002,170,880stderr
4Oct 31, 2026 08:041,49344,815,062101,692,0001,221,0002,170,880stderr
5Oct 31, 2026 08:041,50145,051,665102,429,0001,012,0002,170,880stderr
6Oct 31, 2026 08:041,50245,085,118102,382,0001,196,0002,170,880stderr
7Oct 31, 2026 08:041,50645,199,647102,720,0001,201,0002,170,880stderr
8Oct 31, 2026 08:041,51245,363,634103,555,0001,199,0002,170,880stderr
9Oct 31, 2026 08:041,52545,778,719103,774,0001,026,0002,170,880stderr