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 15, 2024 23:59zielajzielajScore: 5,996Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 15, 2024 23:595,89173,264,89638,246,00010,064,0002,514,944
2Oct 15, 2024 23:595,99670,895,49836,122,00013,044,0002,457,600
3Oct 15, 2024 23:596,25374,415,71640,217,00011,059,0002,269,184