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 7, 2026 20:58Victor MerckléVictor MerckléScore: 3,038Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 7, 2026 21:042,99689,902,600231,909,0003,390,0002,678,784
2Jul 7, 2026 21:043,01590,457,063231,966,0003,435,0002,674,688
3Jul 7, 2026 21:043,01990,598,521233,794,0003,434,0002,670,592
4Jul 7, 2026 21:043,02790,836,660233,900,0003,684,0002,674,688
5Jul 7, 2026 21:043,03891,161,723234,973,0003,687,0002,674,688
6Jul 7, 2026 21:043,03991,199,526234,254,0003,717,0002,674,688
7Jul 7, 2026 21:043,04491,336,547235,195,0003,418,0002,674,688
8Jul 7, 2026 21:043,05191,555,253234,975,0003,698,0002,670,592
9Jul 7, 2026 21:043,05991,793,396233,184,0004,464,0002,740,224