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 04:05Victor MerckléVictor MerckléScore: 3,012Success
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 04:062,99489,825,408235,907,0001,139,0002,170,880stderr
2Aug 16, 2026 04:063,00190,040,106236,258,0001,142,0002,170,880stderr
3Aug 16, 2026 04:063,00390,119,915239,669,0001,129,0002,170,880stderr
4Aug 16, 2026 04:063,01190,345,292237,169,0001,158,0002,170,880stderr
5Aug 16, 2026 04:063,01290,366,401239,448,0001,114,0002,170,880stderr
6Aug 16, 2026 04:063,01990,584,281239,909,0001,087,0002,170,880stderr
7Aug 16, 2026 04:063,02090,603,876236,740,0001,137,0002,170,880stderr
8Aug 16, 2026 04:063,03391,015,203240,457,0001,136,0002,170,880stderr
9Aug 16, 2026 04:063,03991,171,914240,828,0001,141,0002,170,880stderr