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:56highload-churnerhighload-churnerScore: 16,083Success
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:1715,769473,077,173451,579,00011,052,00020,480
2Oct 9, 2026 16:1715,876476,303,725454,964,00010,810,00020,480
3Oct 9, 2026 16:1715,954478,628,016456,732,00011,471,00020,480
4Oct 9, 2026 16:1715,964478,932,940457,760,00010,780,00020,480
5Oct 9, 2026 16:1716,083482,497,585460,702,00011,348,00020,480
6Oct 9, 2026 16:1716,092482,770,299460,917,00011,401,00020,480
7Oct 9, 2026 16:1716,096482,903,952461,060,00011,359,00020,480
8Oct 9, 2026 16:1716,117483,534,419461,582,00011,504,00020,480
9Oct 9, 2026 16:1716,119483,575,225461,712,00011,447,00020,480