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 22:58Victor MerckléVictor MerckléScore: 2,343Success
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 23:032,31669,491,966177,623,0001,145,0002,170,880stderr
2Aug 17, 2026 23:032,31969,596,230176,678,0001,208,0002,170,880stderr
3Aug 17, 2026 23:032,32669,797,837178,649,0001,226,0002,170,880stderr
4Aug 17, 2026 23:032,34270,284,610177,970,0001,240,0002,170,880stderr
5Aug 17, 2026 23:032,34370,306,809177,484,0001,241,0002,170,880stderr
6Aug 17, 2026 23:032,41572,472,497177,586,0001,005,0002,170,880stderr
7Aug 17, 2026 23:032,63078,917,835178,988,0002,116,0002,170,880stderr
8Aug 17, 2026 23:032,74682,403,862194,671,0001,007,0002,170,880stderr
9Aug 17, 2026 23:032,82784,813,809188,964,00010,227,0002,154,496stderr