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:15Andrew EpsteinAndrew EpsteinScore: 1,556Success
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:271,55246,563,676102,520,0001,011,0002,179,072stderr
2Oct 31, 2026 08:271,55346,617,310102,950,0001,011,0002,179,072stderr
3Oct 31, 2026 08:271,55346,599,396101,702,0002,019,0002,183,168stderr
4Oct 31, 2026 08:271,55446,649,128103,209,0001,014,0002,183,168stderr
5Oct 31, 2026 08:271,55646,707,740102,042,0002,036,0002,179,072stderr
6Oct 31, 2026 08:271,56646,985,167102,880,0002,091,0002,179,072stderr
7Oct 31, 2026 08:271,57147,147,576103,206,0002,025,0002,179,072stderr
8Oct 31, 2026 08:271,57747,330,120105,159,0001,015,0002,179,072stderr
9Oct 31, 2026 08:271,60448,146,537101,902,0002,040,0002,179,072stderr