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 09:37Andrew EpsteinAndrew EpsteinScore: 1,479Success
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 09:431,45843,762,38199,693,0001,217,0002,170,880stderr
2Oct 31, 2026 09:431,46343,909,111100,219,0001,177,0002,170,880stderr
3Oct 31, 2026 09:431,47244,167,889100,620,0001,206,0002,170,880stderr
4Oct 31, 2026 09:431,47344,200,657101,295,0001,105,0002,170,880stderr
5Oct 31, 2026 09:431,47944,382,780101,740,0001,085,0002,170,880stderr
6Oct 31, 2026 09:431,48244,465,244101,838,0001,157,0002,170,880stderr
7Oct 31, 2026 09:431,49344,795,945102,498,0001,213,0002,162,688stderr
8Oct 31, 2026 09:431,51245,384,354101,474,0001,191,0002,170,880stderr
9Oct 31, 2026 09:431,52445,744,960105,799,0001,028,0002,170,880stderr