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:54Andrew EpsteinAndrew EpsteinScore: 1,484Success
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:581,44443,348,57097,293,0002,211,0002,170,880stderr
2Oct 31, 2026 09:581,47344,202,16799,780,0002,117,0002,162,688stderr
3Oct 31, 2026 09:581,48244,478,650100,799,0002,065,0002,170,880stderr
4Oct 31, 2026 09:581,48244,479,792101,929,0001,191,0002,162,688stderr
5Oct 31, 2026 09:581,48444,547,940101,883,0001,193,0002,170,880stderr
6Oct 31, 2026 09:581,49344,797,299100,837,0003,111,0002,170,880stderr
7Oct 31, 2026 09:581,49344,794,884102,614,0001,204,0002,170,880stderr
8Oct 31, 2026 09:581,49444,842,426102,816,0001,032,0002,170,880stderr
9Oct 31, 2026 09:581,49944,989,548103,079,0001,068,0002,174,976stderr