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 15:13Victor MerckléVictor MerckléScore: 2,299Success
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 15:142,24867,447,285171,363,0001,263,0002,170,880stderr
2Aug 16, 2026 15:142,27368,192,132173,289,0002,047,0002,170,880stderr
3Aug 16, 2026 15:142,28568,577,700173,390,0002,060,0002,170,880stderr
4Aug 16, 2026 15:142,29668,894,493173,270,0001,012,0002,170,880stderr
5Aug 16, 2026 15:142,29968,978,828172,545,0002,044,0002,170,880stderr
6Aug 16, 2026 15:142,31469,431,679174,580,0001,023,0002,170,880stderr
7Aug 16, 2026 15:142,31969,594,002174,989,0001,026,0002,170,880stderr
8Aug 16, 2026 15:142,33169,939,854176,611,0001,026,0002,170,880stderr
9Aug 16, 2026 15:142,34670,382,842175,875,0001,023,0002,170,880stderr