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 31, 2026 15:26Victor MerckléVictor MerckléScore: 1,699Success
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Sep 5, 2026 00:39Tomislav Tunkovic10.00CustomSolution Held
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 31, 2026 15:281,66750,021,604119,328,0001,009,0002,170,880stderr
2Aug 31, 2026 15:281,67050,129,186119,116,0001,010,0002,170,880stderr
3Aug 31, 2026 15:281,68950,671,112120,779,0001,009,0002,170,880stderr
4Aug 31, 2026 15:281,69450,824,614122,408,0001,204,0002,170,880stderr
5Aug 31, 2026 15:281,69950,972,267119,472,0001,029,0002,170,880stderr
6Aug 31, 2026 15:281,70551,162,385121,874,0001,008,0002,170,880stderr
7Aug 31, 2026 15:281,71551,456,082123,128,0001,011,0002,170,880stderr
8Aug 31, 2026 15:281,72251,662,864120,295,0001,239,0002,170,880stderr
9Aug 31, 2026 15:281,76152,850,762121,475,0001,044,0002,170,880stderr