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 listOct 10, 2026 00:30highload-churnerhighload-churnerScore: 13,018Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 10, 2026 01:5812,323369,703,860303,605,00054,309,00032,768
2Oct 10, 2026 01:5812,332369,976,803303,814,00054,255,00032,768
3Oct 10, 2026 01:5812,452373,585,269306,971,00054,857,00032,768
4Oct 10, 2026 01:5813,013390,417,173323,054,00056,230,00032,768
5Oct 10, 2026 01:5813,018390,556,918323,035,00056,300,00032,768
6Oct 10, 2026 01:5813,049391,479,467324,364,00056,062,00032,768
7Oct 10, 2026 01:5813,054391,639,794322,613,00056,247,00032,768
8Oct 10, 2026 01:5813,098392,962,949325,736,00056,059,00032,768
9Oct 10, 2026 01:5813,480404,420,632334,047,00056,296,00032,768