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:05Andrew EpsteinAndrew EpsteinScore: 1,475Success
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:071,45943,782,935100,500,0001,093,0002,162,688stderr
2Oct 31, 2026 09:071,45943,772,48599,486,0001,167,0002,170,880stderr
3Oct 31, 2026 09:071,46844,052,956100,953,0001,112,0002,170,880stderr
4Oct 31, 2026 09:071,47344,198,237101,382,0001,076,0002,162,688stderr
5Oct 31, 2026 09:071,47544,256,60998,867,0002,979,0002,170,880stderr
6Oct 31, 2026 09:071,47944,390,602101,459,0001,236,0002,170,880stderr
7Oct 31, 2026 09:071,47944,384,464101,196,0001,212,0002,170,880stderr
8Oct 31, 2026 09:071,48744,631,974102,240,0001,184,0002,170,880stderr
9Oct 31, 2026 09:071,55146,534,774107,845,0001,079,0002,170,880stderr