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 04:49Andrew EpsteinAndrew EpsteinScore: 1,519Success
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 04:501,47344,192,028100,654,0001,021,0002,170,880stderr
2Oct 31, 2026 04:501,48544,555,311102,308,0001,203,0002,162,688stderr
3Oct 31, 2026 04:501,49344,807,139102,540,0001,197,0002,170,880stderr
4Oct 31, 2026 04:501,50945,277,177104,558,0001,146,0002,170,880stderr
5Oct 31, 2026 04:501,51945,590,664104,902,0001,010,0002,170,880stderr
6Oct 31, 2026 04:501,52245,664,478105,353,0001,274,0002,162,688stderr
7Oct 31, 2026 04:501,53446,031,801104,305,0003,184,0002,170,880stderr
8Oct 31, 2026 04:501,53546,071,523106,659,0001,012,0002,170,880stderr
9Oct 31, 2026 04:501,55346,604,669103,724,0001,167,0002,162,688stderr