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: 34,234Success
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:5433,881299,670,403111,930,000165,896,0002,433,024
2Apr 20, 2026 15:5434,234307,587,802109,891,000170,830,0002,441,216
3Apr 20, 2026 15:5434,553310,204,366110,743,000172,599,0002,433,024