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 listJul 8, 2026 00:17Victor MerckléVictor MerckléScore: 3,031Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 8, 2026 00:203,00990,294,204233,528,0003,215,0002,678,784
2Jul 8, 2026 00:203,01290,380,019233,738,0003,144,0002,670,592
3Jul 8, 2026 00:203,01590,469,722233,090,0003,119,0002,674,688
4Jul 8, 2026 00:203,02090,613,891234,236,0003,098,0002,674,688
5Jul 8, 2026 00:203,03190,934,506233,214,0003,501,0002,674,688
6Jul 8, 2026 00:203,03891,152,688234,731,0003,374,0002,674,688
7Jul 8, 2026 00:203,06692,005,229238,130,0003,413,0002,674,688
8Jul 8, 2026 00:203,06792,022,671236,797,0003,674,0002,740,224
9Jul 8, 2026 00:203,08492,537,197237,135,0003,685,0002,674,688