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 listSep 1, 2026 11:32Victor MerckléVictor MerckléScore: 1,913Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 1, 2026 11:331,89256,773,558137,857,0002,042,0002,170,880stderr
2Sep 1, 2026 11:331,89756,920,333138,966,0001,037,0002,170,880stderr
3Sep 1, 2026 11:331,89856,956,334139,240,0002,023,0002,170,880stderr
4Sep 1, 2026 11:331,91057,306,214139,182,0002,032,0002,170,880stderr
5Sep 1, 2026 11:331,91357,394,480139,479,0001,017,0002,170,880stderr
6Sep 1, 2026 11:331,92357,707,732138,567,0002,007,0002,170,880stderr
7Sep 1, 2026 11:331,92657,780,052139,797,0001,026,0002,170,880stderr
8Sep 1, 2026 11:331,92757,839,185138,944,0001,035,0002,170,880stderr
9Sep 1, 2026 11:331,93458,032,218139,088,0001,036,0002,170,880stderr