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:21Andrew EpsteinAndrew EpsteinScore: 1,511Success
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:271,49944,970,056103,434,0001,117,0002,166,784
2Oct 31, 2026 05:271,50145,038,561103,381,0001,180,0002,166,784
3Oct 31, 2026 05:271,50345,099,589103,450,0001,167,0002,166,784
4Oct 31, 2026 05:271,50745,210,232104,021,0001,173,0002,166,784
5Oct 31, 2026 05:271,51145,343,562104,639,0001,042,0002,166,784
6Oct 31, 2026 05:271,51245,368,532104,616,0001,128,0002,166,784
7Oct 31, 2026 05:271,51845,555,449104,215,0001,191,0002,158,592
8Oct 31, 2026 05:271,51845,564,819105,147,0001,163,0002,166,784
9Oct 31, 2026 05:271,52245,673,537105,713,0001,070,0002,158,592