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 22:59highload-churnerhighload-churnerScore: 12,276Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 10, 2026 00:2811,586347,595,114288,503,00048,108,00020,480
2Oct 10, 2026 00:2811,768353,052,154293,678,00048,574,00020,480
3Oct 10, 2026 00:2811,819354,579,876294,887,00048,989,00020,480
4Oct 10, 2026 00:2812,266368,001,397307,992,00049,169,00020,480
5Oct 10, 2026 00:2812,276368,297,745307,809,00049,998,00020,480
6Oct 10, 2026 00:2812,277368,317,476307,809,00050,057,00020,480
7Oct 10, 2026 00:2812,296368,889,470309,286,00049,010,00020,480
8Oct 10, 2026 00:2812,327369,823,865309,232,00050,107,00020,480
9Oct 10, 2026 00:2812,348370,441,071309,972,00049,990,00020,480