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,950Success
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:061,44643,380,81298,701,0001,225,0002,154,496stderr
2Oct 31, 2026 09:061,46944,097,749100,336,0001,037,0002,154,496stderr
3Oct 31, 2026 09:061,47544,260,552101,512,0001,207,0002,150,400stderr
4Oct 31, 2026 09:061,85355,618,337110,413,0001,310,0002,150,400stderr
5Oct 31, 2026 09:061,95058,519,856114,031,0003,050,0002,154,496stderr
6Oct 31, 2026 09:061,97359,204,423115,945,0003,017,0002,154,496stderr
7Oct 31, 2026 09:061,98059,410,284119,898,0003,029,0002,162,688stderr
8Oct 31, 2026 09:062,01660,481,679118,806,0001,019,0002,162,688stderr
9Oct 31, 2026 09:062,42572,752,715128,989,0003,017,0002,162,688stderr