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 listMar 3, 2026 23:20olliecrowolliecrowScore: 17,678Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 3, 2026 23:2017,659170,310,115142,809,0001,997,0002,514,944
2Mar 3, 2026 23:2017,660169,525,057143,818,000998,0002,523,136
3Mar 3, 2026 23:2017,671172,158,520142,901,0001,998,0002,281,472
4Mar 3, 2026 23:2017,675175,246,312143,932,000999,0002,531,328
5Mar 3, 2026 23:2017,678172,535,933142,957,0001,999,0002,273,280
6Mar 3, 2026 23:2017,680169,240,142142,980,0001,999,0002,514,944
7Mar 3, 2026 23:2017,697174,388,979144,118,0001,000,0002,506,752
8Mar 3, 2026 23:2017,699172,419,833143,128,0002,001,0002,510,848
9Mar 3, 2026 23:2017,704170,801,781144,172,0001,001,0002,514,944