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 18:32Victor MerckléVictor MerckléScore: 1,883Success
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 18:331,85555,664,738136,092,0001,014,0002,170,880stderr
2Aug 23, 2026 18:331,87156,140,806134,801,0001,003,0002,170,880stderr
3Aug 23, 2026 18:331,87256,164,441134,997,0001,004,0002,170,880stderr
4Aug 23, 2026 18:331,87456,220,446135,560,0001,009,0002,170,880stderr
5Aug 23, 2026 18:331,88356,500,963134,783,0001,247,0002,170,880stderr
6Aug 23, 2026 18:331,88556,557,529136,346,0001,004,0002,170,880stderr
7Aug 23, 2026 18:331,88656,609,144139,267,0001,269,0002,170,880stderr
8Aug 23, 2026 18:331,90357,094,025140,595,0001,245,0002,170,880stderr
9Aug 23, 2026 18:331,92357,713,189140,879,0001,003,0002,170,880stderr