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:07Andrew EpsteinAndrew EpsteinScore: 1,508Success
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:191,46043,818,966100,485,0001,119,0002,158,592stderr
2Oct 31, 2026 08:191,48444,535,178102,325,0001,122,0002,162,688stderr
3Oct 31, 2026 08:191,48644,594,989102,403,0001,246,0002,158,592stderr
4Oct 31, 2026 08:191,49844,958,205103,439,0001,135,0002,170,880stderr
5Oct 31, 2026 08:191,50845,258,071104,717,0001,070,0002,170,880stderr
6Oct 31, 2026 08:191,51845,567,774105,215,0001,020,0002,170,880stderr
7Oct 31, 2026 08:191,54046,221,663102,299,0001,199,0002,170,880stderr
8Oct 31, 2026 08:191,59647,899,549104,881,0001,115,0002,170,880stderr
9Oct 31, 2026 08:191,94458,321,100117,679,0001,197,0002,158,592stderr