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 14:25Victor MerckléVictor MerckléScore: 2,736Success
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 14:272,72581,772,193215,417,0001,036,0002,170,880stderr
2Aug 23, 2026 14:272,72981,882,788215,484,0001,106,0002,170,880stderr
3Aug 23, 2026 14:272,73381,995,784214,988,0001,047,0002,170,880stderr
4Aug 23, 2026 14:272,73582,069,507215,944,0001,087,0002,170,880stderr
5Aug 23, 2026 14:272,73682,087,458216,198,0001,125,0002,170,880stderr
6Aug 23, 2026 14:272,74482,323,353216,286,0001,113,0002,170,880stderr
7Aug 23, 2026 14:272,74882,469,316215,728,0001,044,0002,170,880stderr
8Aug 23, 2026 14:272,75282,560,492214,989,0001,039,0002,170,880stderr
9Aug 23, 2026 14:272,76182,834,945215,382,0001,069,0002,170,880stderr