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:01Andrew EpsteinAndrew EpsteinScore: 1,499Success
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:081,48644,580,884101,488,0001,264,0002,170,880stderr
2Oct 31, 2026 08:081,48944,670,705102,240,0001,027,0002,170,880stderr
3Oct 31, 2026 08:081,49144,735,222101,512,0002,047,0002,170,880stderr
4Oct 31, 2026 08:081,49444,843,533102,644,0001,027,0002,170,880stderr
5Oct 31, 2026 08:081,49944,981,635102,366,0001,013,0002,162,688stderr
6Oct 31, 2026 08:081,50145,042,427103,531,0001,279,0002,170,880stderr
7Oct 31, 2026 08:081,50245,080,018104,331,0001,015,0002,170,880stderr
8Oct 31, 2026 08:081,50245,086,143103,195,0001,034,0002,170,880stderr
9Oct 31, 2026 08:081,51845,542,203104,118,0001,017,0002,162,688stderr