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 listAug 23, 2026 15:03Victor MerckléVictor MerckléScore: 2,197Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 23, 2026 15:042,16664,982,108162,621,0001,005,0002,170,880stderr
2Aug 23, 2026 15:042,17865,353,310164,485,0001,019,0002,170,880stderr
3Aug 23, 2026 15:042,18865,669,075165,352,0001,008,0002,170,880stderr
4Aug 23, 2026 15:042,19165,751,580164,628,0001,004,0002,170,880stderr
5Aug 23, 2026 15:042,19765,910,877167,753,0001,186,0002,170,880stderr
6Aug 23, 2026 15:042,19765,917,341166,049,0002,019,0002,170,880stderr
7Aug 23, 2026 15:042,21266,381,555166,709,0001,003,0002,170,880stderr
8Aug 23, 2026 15:042,21366,399,437168,852,0001,255,0002,170,880stderr
9Aug 23, 2026 15:042,22666,795,541169,913,0001,253,0002,170,880stderr