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 14, 2026 00:24highload-churnerhighload-churnerScore: 4,146Success
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Oct 15, 2026 18:15Andrew Epstein148.23CustomSolution Held
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 14, 2026 00:253,940118,203,890107,033,0002,011,00045,056
2Oct 14, 2026 00:254,064121,934,643109,530,0003,263,00045,056
3Oct 14, 2026 00:254,119123,587,769111,340,0003,031,00045,056
4Oct 14, 2026 00:254,138124,140,470111,978,0003,018,00045,056
5Oct 14, 2026 00:254,146124,381,122112,164,0003,034,00045,056
6Oct 14, 2026 00:254,175125,277,979113,154,0003,014,00045,056
7Oct 14, 2026 00:254,271128,148,498115,791,0003,054,00045,056
8Oct 14, 2026 00:254,302129,078,470116,856,0003,049,00045,056
9Oct 14, 2026 00:254,368131,060,327118,818,0003,045,00045,056