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 06:47Andrew EpsteinAndrew EpsteinScore: 1,482Success
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 06:521,43943,198,40898,068,0001,134,0002,170,880stderr
2Oct 31, 2026 06:521,45143,551,85098,589,0001,264,0002,170,880stderr
3Oct 31, 2026 06:521,46643,991,038100,371,0001,153,0002,170,880stderr
4Oct 31, 2026 06:521,47544,258,689101,217,0001,011,0002,170,880stderr
5Oct 31, 2026 06:521,48244,476,337101,863,0001,288,0002,162,688stderr
6Oct 31, 2026 06:521,48844,659,629102,407,0001,036,0002,170,880stderr
7Oct 31, 2026 06:521,49844,946,624102,643,0001,020,0002,170,880stderr
8Oct 31, 2026 06:521,50145,042,852103,875,0001,013,0002,162,688stderr
9Oct 31, 2026 06:521,52545,758,368101,203,0001,032,0002,162,688stderr