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 listOct 16, 2024 23:43zielajzielajError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 16, 2024 23:4200000Error: Exit with code 1: not a dynamic executable 1600000 771786 801117 2184437042 2184437042 3000000 2181437042 2187437042 2181437042 2187437042 50000000 100000000 2181437042 2187437042 49861496 136194stderr
2Oct 16, 2024 23:434,27361,673,94534,038,0001,001,0002,404,352
3Oct 16, 2024 23:434,31662,696,50934,382,0001,011,0002,289,664
4Oct 16, 2024 23:434,32956,768,47735,497,00002,310,144