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 17, 2026 13:32Victor MerckléVictor MerckléScore: 2,459Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 17, 2026 13:412,42772,827,139187,403,0001,213,0002,170,880stderr
2Aug 17, 2026 13:412,44673,406,321187,431,0001,217,0002,170,880stderr
3Aug 17, 2026 13:412,45273,568,610187,344,0001,229,0002,170,880stderr
4Aug 17, 2026 13:412,45773,736,931186,994,0001,238,0002,170,880stderr
5Aug 17, 2026 13:412,45973,792,965187,734,0001,228,0002,170,880stderr
6Aug 17, 2026 13:412,46173,838,629186,385,0001,240,0002,170,880stderr
7Aug 17, 2026 13:412,48174,456,770187,718,0001,232,0002,170,880stderr
8Aug 17, 2026 13:412,51875,542,907186,849,0001,251,0002,170,880stderr
9Aug 17, 2026 13:412,53275,970,676186,863,0001,234,0002,170,880stderr