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 23, 2026 16:17Victor MerckléVictor MerckléScore: 3,250Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 23, 2026 16:183,21296,365,183256,170,0001,154,0002,170,880stderr
2Aug 23, 2026 16:183,21496,424,853256,277,0001,158,0002,170,880stderr
3Aug 23, 2026 16:183,21996,583,486256,784,0001,151,0002,170,880stderr
4Aug 23, 2026 16:183,24797,416,168255,462,0001,157,0002,170,880stderr
5Aug 23, 2026 16:183,25097,507,583257,716,0001,183,0002,170,880stderr
6Aug 23, 2026 16:183,25897,767,017257,118,0001,155,0002,170,880stderr
7Aug 23, 2026 16:183,795113,850,494306,991,0002,260,0002,170,880stderr
8Aug 23, 2026 16:183,823114,695,749312,130,0002,233,0002,170,880stderr
9Aug 23, 2026 16:183,933118,017,151323,686,0001,005,0002,170,880stderr