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:48Victor MerckléVictor MerckléScore: 1,844Success
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:491,81754,525,346132,660,0001,012,0002,170,880stderr
2Aug 23, 2026 18:491,82754,811,028133,757,0001,284,0002,170,880stderr
3Aug 23, 2026 18:491,82854,842,888132,492,0001,003,0002,170,880stderr
4Aug 23, 2026 18:491,83455,036,994134,778,0001,260,0002,170,880stderr
5Aug 23, 2026 18:491,84455,333,113134,210,0001,007,0002,170,880stderr
6Aug 23, 2026 18:491,85755,734,191136,864,0001,247,0002,170,880stderr
7Aug 23, 2026 18:491,85855,745,229136,942,0001,248,0002,170,880stderr
8Aug 23, 2026 18:491,87556,266,957137,525,0001,025,0002,170,880stderr
9Aug 23, 2026 18:491,89356,815,867139,950,0001,278,0002,170,880stderr