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:30Victor MerckléVictor MerckléScore: 2,306Success
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:322,28768,614,947174,982,0001,207,0002,170,880stderr
2Aug 16, 2026 15:322,29268,777,083174,716,0001,218,0002,170,880stderr
3Aug 16, 2026 15:322,29968,998,753174,297,0001,214,0002,170,880stderr
4Aug 16, 2026 15:322,30669,204,214174,334,0001,236,0002,170,880stderr
5Aug 16, 2026 15:322,30669,200,872174,541,0001,223,0002,170,880stderr
6Aug 16, 2026 15:322,32669,782,065174,059,0001,238,0002,170,880stderr
7Aug 16, 2026 15:322,32969,886,326175,492,0001,254,0002,170,880stderr
8Aug 16, 2026 15:322,33269,968,291174,715,0001,235,0002,170,880stderr
9Aug 16, 2026 15:322,34270,281,774174,321,0001,255,0002,170,880stderr