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 15:09highload-churnerhighload-churnerScore: 15,842Success
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 15:2315,518465,548,403444,389,00010,717,00020,480
2Oct 9, 2026 15:2315,548466,456,326445,284,00010,698,00020,480
3Oct 9, 2026 15:2315,764472,929,796451,687,00010,632,00020,480
4Oct 9, 2026 15:2315,789473,680,407452,192,00011,066,00020,480
5Oct 9, 2026 15:2315,842475,263,918453,632,00011,238,00020,480
6Oct 9, 2026 15:2315,881476,442,191454,704,00011,323,00020,480
7Oct 9, 2026 15:2315,903477,112,471455,352,00011,259,00020,480
8Oct 9, 2026 15:2316,501495,057,100466,484,00011,237,00020,480
9Oct 9, 2026 15:2316,561496,851,293463,267,00011,269,00020,480