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 22:38Victor MerckléVictor MerckléScore: 2,263Success
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 22:482,23667,107,145170,766,0001,222,0002,170,880stderr
2Aug 16, 2026 22:482,25267,589,170169,396,0001,230,0002,170,880stderr
3Aug 16, 2026 22:482,26067,827,048170,368,0001,217,0002,170,880stderr
4Aug 16, 2026 22:482,26167,831,502169,984,0001,230,0002,170,880stderr
5Aug 16, 2026 22:482,26367,895,255170,364,0001,220,0002,170,880stderr
6Aug 16, 2026 22:482,26667,986,333170,272,0001,229,0002,170,880stderr
7Aug 16, 2026 22:482,29068,725,667170,802,0001,244,0002,170,880stderr
8Aug 16, 2026 22:482,54476,324,464174,368,0001,004,0002,170,880stderr
9Aug 16, 2026 22:482,61878,557,354180,402,0002,019,0002,170,880stderr