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 05:10Victor MerckléVictor MerckléScore: 3,005Success
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 05:112,96088,829,607238,242,0001,189,0002,170,880stderr
2Aug 16, 2026 05:112,99989,990,401238,970,0001,005,0002,170,880stderr
3Aug 16, 2026 05:113,00190,045,800239,962,0001,025,0002,170,880stderr
4Aug 16, 2026 05:113,00490,124,514240,318,0001,005,0002,170,880stderr
5Aug 16, 2026 05:113,00590,173,174238,429,0001,029,0002,170,880stderr
6Aug 16, 2026 05:113,00690,188,098238,666,0001,008,0002,170,880stderr
7Aug 16, 2026 05:113,00890,269,000241,443,0001,275,0002,170,880stderr
8Aug 16, 2026 05:113,02090,620,382238,446,0001,004,0002,170,880stderr
9Aug 16, 2026 05:113,02390,711,219241,006,0001,016,0002,170,880stderr