Cody

Problem 925. Unique - Very Very Large Numbers

Solution 1693776

Submitted on 16 Dec 2018 by Martin C.
This solution is locked. To view this solution, you need to provide a solution of the same size or smaller.
Solve This Problem View on Solution Map

Test Suite

Test Status Code Input and Output
1   Pass
a=randi(2^32,100,'uint32'); assert(isequal(unique_large(a),unique(a)))
2   Pass
format long a=[uint64(9223372036854775808);uint64(9223372036854775806)]; out=unique_large(a); assert(isequal(out,flipud(a)),sprintf('\nsize(a)= %i %i \noutput= \n %14.0f\n %14.0f \n',size(out),out))
3   Pass
format long a=[uint64(18446744073709551615);uint64(18233720368547758060);uint64(9223372036854779806)]; out=unique_large(a); assert(isequal(out,flipud(a)),sprintf('\nsize(a)= %i %i \noutput= \n %16.0f \n %16.0f \n %16.0f \n',size(out),out))

Suggested Problems

More from this Author236