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 9, 2026 16:19highload-churnerhighload-churnerScore: 17,115Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 9, 2026 16:3716,829504,886,300483,541,00010,874,00024,576stderr
2Oct 9, 2026 16:3716,922507,666,693486,334,00010,699,00024,576stderr
3Oct 9, 2026 16:3716,972509,177,422487,974,00010,740,00024,576stderr
4Oct 9, 2026 16:3717,021510,636,423489,451,00010,756,00024,576stderr
5Oct 9, 2026 16:3717,115513,464,546492,248,00010,734,00024,576stderr
6Oct 9, 2026 16:3717,163514,893,301493,058,00011,282,00024,576stderr
7Oct 9, 2026 16:3717,198515,963,291494,164,00011,205,00024,576stderr
8Oct 9, 2026 16:3717,259517,771,198496,144,00011,147,00024,576stderr
9Oct 9, 2026 16:3717,412522,362,411500,991,00010,973,00024,576stderr