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 listMay 24, 2025 07:25KeefeKeefeScore: 14,363Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 24, 2025 07:2514,244146,050,566113,807,0002,994,0002,396,160
2May 24, 2025 07:2514,363142,750,254116,781,000998,0002,281,472
3May 24, 2025 07:2514,378141,671,473115,899,0001,998,0002,400,256