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:47Victor MerckléVictor MerckléScore: 1,968Success
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:491,95558,658,609143,411,0001,026,0002,170,880stderr
2Aug 23, 2026 16:491,95858,744,045142,147,0002,055,0002,170,880stderr
3Aug 23, 2026 16:491,96258,875,073142,684,0001,035,0002,170,880stderr
4Aug 23, 2026 16:491,96258,876,074142,549,0002,057,0002,170,880stderr
5Aug 23, 2026 16:491,96859,046,015144,355,0001,032,0002,170,880stderr
6Aug 23, 2026 16:491,96959,099,050143,666,0002,046,0002,170,880stderr
7Aug 23, 2026 16:491,98959,696,799145,765,0001,030,0002,170,880stderr
8Aug 23, 2026 16:491,99659,895,283145,620,0001,025,0002,170,880stderr
9Aug 23, 2026 16:492,00060,027,852145,925,0002,038,0002,170,880stderr