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 18:20highload-churnerhighload-churnerScore: 15,364Success
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 18:2115,300459,008,467437,686,00010,707,00020,480
2Oct 9, 2026 18:2115,338460,166,654439,108,00010,654,00020,480
3Oct 9, 2026 18:2115,347460,410,114439,214,00010,760,00020,480
4Oct 9, 2026 18:2115,362460,862,361439,729,00010,680,00020,480
5Oct 9, 2026 18:2115,364460,940,468439,666,00010,764,00020,480
6Oct 9, 2026 18:2115,382461,473,297440,087,00010,944,00020,480
7Oct 9, 2026 18:2115,423462,710,871441,367,00010,782,00020,480
8Oct 9, 2026 18:2115,449463,498,117442,132,00010,791,00020,480
9Oct 9, 2026 18:2115,550466,511,186444,996,00010,997,00020,480