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 16, 2026 04:27highload-churnerhighload-churnerScore: 7,228Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 16, 2026 04:287,057211,713,151518,660,00010,015,000155,648
2Oct 16, 2026 04:287,090212,703,491516,334,00010,069,000147,456
3Oct 16, 2026 04:287,203216,119,751515,237,00010,031,000151,552
4Oct 16, 2026 04:287,211216,349,522517,067,0009,966,000151,552
5Oct 16, 2026 04:287,228216,858,801515,435,0009,998,000159,744
6Oct 16, 2026 04:287,268218,062,155517,216,00010,001,000151,552
7Oct 16, 2026 04:287,287218,636,380525,017,00010,104,000151,552
8Oct 16, 2026 04:287,340220,222,247514,420,0009,998,000151,552
9Oct 16, 2026 04:287,505225,175,329516,304,00010,039,000147,456