Median Sergey Svistunov

Find the median of a stream of binary integers as fast as possible.

Input: 100 000 000 uint32 values in little-endian binary on STDIN (4 bytes each).

Output: The median value, printed as a decimal string. The median is defined as the element at index N/2 (i.e., a[50000000]) in the sorted array.

Back to listJun 15, 2023 09:57Ulyanov AlekseyUlyanov AlekseyScore: 28,610Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 15, 2023 10:0627,611295,520,172226,407,14402,277,376
2Jun 15, 2023 10:0627,684289,319,379227,008,74102,269,184
3Jun 15, 2023 09:5728,485294,524,067233,576,91002,269,184
4Jun 15, 2023 10:0628,610309,615,088234,602,65302,269,184
5Jun 15, 2023 09:5728,786305,875,753236,046,64302,265,088
6Jun 15, 2023 09:5728,861294,710,962236,657,43202,256,896