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 02:16Victor MerckléVictor MerckléScore: 7,357Success
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 02:177,189215,697,184614,535,0003,061,0002,269,184stderr
2Aug 16, 2026 02:177,207216,239,845611,254,0004,077,0002,289,664stderr
3Aug 16, 2026 02:177,223216,714,506612,896,0003,052,0002,326,528stderr
4Aug 16, 2026 02:177,264217,934,031620,593,0003,024,0002,260,992stderr
5Aug 16, 2026 02:177,357220,727,244629,439,0003,009,0002,560,000stderr
6Aug 16, 2026 02:177,611228,353,991648,309,0003,071,0002,527,232stderr
7Aug 16, 2026 02:177,623228,691,383652,373,0004,018,0002,297,856stderr
8Aug 16, 2026 02:177,751232,541,786662,717,0004,071,0002,580,480stderr
9Aug 16, 2026 02:177,802234,080,946663,529,0004,102,0002,420,736stderr