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 09:54Victor MerckléVictor MerckléScore: 2,973Success
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 09:562,90687,184,442229,927,0003,170,0002,707,456stderr
2Jul 8, 2026 09:562,91787,518,090231,366,0003,184,0002,711,552stderr
3Jul 8, 2026 09:562,93387,996,372232,753,0003,165,0002,707,456stderr
4Jul 8, 2026 09:562,95188,559,213231,665,0003,198,0002,711,552stderr
5Jul 8, 2026 09:562,97389,211,195233,785,0003,205,0002,711,552stderr
6Jul 8, 2026 09:562,97589,266,795232,921,0003,345,0002,711,552stderr
7Jul 8, 2026 09:563,02590,758,148234,102,0003,192,0002,707,456stderr
8Jul 8, 2026 09:563,05491,628,801236,097,0003,192,0002,711,552stderr
9Jul 8, 2026 09:563,05891,753,782236,094,0003,182,0002,711,552stderr