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:28zielajzielajScore: 153,413Success
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:28141,9041,186,098,7161,025,656,000137,953,0002,408,448
2Oct 15, 2024 23:28153,4131,289,456,6111,118,099,000139,887,0002,514,944
3Oct 15, 2024 23:28157,7231,319,987,1671,165,396,000127,933,0002,519,040