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 15, 2026 21:03Victor MerckléVictor MerckléScore: 6,910Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 15, 2026 21:046,831204,941,858579,440,0003,406,0002,695,168stderr
2Aug 15, 2026 21:046,867206,013,497581,075,0003,491,0002,433,024stderr
3Aug 15, 2026 21:046,870206,111,443583,143,0002,238,0002,433,024stderr
4Aug 15, 2026 21:046,903207,105,402583,677,0003,501,0002,433,024stderr
5Aug 15, 2026 21:046,910207,315,780586,779,0003,503,0002,695,168stderr
6Aug 15, 2026 21:046,913207,419,194584,700,0003,417,0002,695,168stderr
7Aug 15, 2026 21:046,966209,009,628589,050,0005,432,0002,695,168stderr
8Aug 15, 2026 21:046,982209,469,070591,628,0003,692,0002,195,456stderr
9Aug 15, 2026 21:046,993209,795,225595,736,0003,514,0002,453,504stderr