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 13, 2024 02:04zielajzielajScore: 15,459Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 13, 2024 02:0415,365154,893,347112,996,00012,999,0002,482,176
2Oct 13, 2024 02:0415,459154,124,336117,783,0008,983,0002,400,256
3Oct 13, 2024 02:0415,854157,052,973116,002,00014,000,0002,461,696