This Speed Performance Challenge is to optimize Unique for processing uint8/uint16/uint32 variables.
Input: A (column vector of uint8/uint16/uint32)
Output: B (column vector A processed by unique "like" function)
Scoring: Cumulative time, in msec, of "unique" processing of three medium size arrays.
Examples: [5;4;3;2;2;1] returns [1;2;3;4;5], and Fast
Hint: Help Unique, Legacy, Options
Solution Stats
Problem Comments
Problem Recent Solvers16
Suggested Problems
-
430 Solvers
-
It dseon't mettar waht oedrr the lrettes in a wrod are.
509 Solvers
-
Increment a number, given its digits
514 Solvers
-
158 Solvers
-
Split a string into chunks of specified length
183 Solvers
More from this Author236
Problem Tags
Select a Web Site
Choose a web site to get translated content where available and see local events and offers. Based on your location, we recommend that you select: .
Select web siteYou can also select a web site from the following list:
Americas
- América Latina (Español)
- Canada (English)
- United States (English)
Europe
- Belgium (English)
- Denmark (English)
- Deutschland (Deutsch)
- España (Español)
- Finland (English)
- France (Français)
- Ireland (English)
- Italia (Italiano)
- Luxembourg (English)
- Netherlands (English)
- Norway (English)
- Österreich (Deutsch)
- Portugal (English)
- Sweden (English)
- Switzerland
- United Kingdom (English)