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 01:26Victor MerckléVictor MerckléScore: 2,257Success
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 01:362,22966,879,237168,687,0001,249,0002,170,880stderr
2Aug 17, 2026 01:362,23967,180,119170,412,0001,204,0002,170,880stderr
3Aug 17, 2026 01:362,24967,471,051169,885,0001,240,0002,170,880stderr
4Aug 17, 2026 01:362,25767,733,434168,955,0001,240,0002,170,880stderr
5Aug 17, 2026 01:362,25767,721,813169,911,0001,220,0002,170,880stderr
6Aug 17, 2026 01:362,26167,855,560169,189,0001,236,0002,170,880stderr
7Aug 17, 2026 01:362,26868,062,147170,495,0001,220,0002,170,880stderr
8Aug 17, 2026 01:362,27768,331,911170,050,0001,247,0002,170,880stderr
9Aug 17, 2026 01:362,27968,389,896169,162,0001,238,0002,170,880stderr