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 13:18Victor MerckléVictor MerckléScore: 2,999Success
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 13:202,93488,029,780229,562,0003,220,0002,711,552stderr
2Jul 8, 2026 13:202,95088,525,683232,953,0003,273,0002,711,552stderr
3Jul 8, 2026 13:202,95188,533,740232,064,0003,222,0002,707,456stderr
4Jul 8, 2026 13:202,97789,321,818231,947,0004,303,0002,711,552stderr
5Jul 8, 2026 13:202,99989,995,171234,081,0003,191,0002,707,456stderr
6Jul 8, 2026 13:203,03991,196,116234,261,0003,206,0002,711,552stderr
7Jul 8, 2026 13:203,04991,490,046235,120,0003,206,0002,707,456stderr
8Jul 8, 2026 13:203,05191,555,567232,659,0004,305,0002,711,552stderr
9Jul 8, 2026 13:203,05891,746,736235,453,0003,223,0002,711,552stderr