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 listApr 20, 2026 15:52BenBenScore: 33,231Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 20, 2026 15:5333,189293,315,135102,059,000170,098,0002,441,216
2Apr 20, 2026 15:5333,231295,179,989104,808,000167,694,0002,265,088
3Apr 20, 2026 15:5333,634299,761,93598,930,000176,876,0002,510,848