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 16, 2026 20:55Victor MerckléVictor MerckléScore: 2,133Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 16, 2026 20:552,10263,074,817157,837,0001,005,0002,170,880stderr
2Aug 16, 2026 20:552,12063,615,199160,422,0001,174,0002,170,880stderr
3Aug 16, 2026 20:552,12663,785,503158,116,0001,234,0002,170,880stderr
4Aug 16, 2026 20:552,13163,945,966157,842,0001,251,0002,170,880stderr
5Aug 16, 2026 20:552,13364,000,603159,098,0001,284,0002,170,880stderr
6Aug 16, 2026 20:552,13464,039,188158,563,0001,245,0002,170,880stderr
7Aug 16, 2026 20:552,15364,595,833158,178,0001,266,0002,170,880stderr
8Aug 16, 2026 20:552,16164,853,412159,179,0001,240,0002,170,880stderr
9Aug 16, 2026 20:552,20466,129,366158,720,0001,255,0002,170,880stderr