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 listJan 18, 2026 05:19Josu San MartinJosu San MartinScore: 8,936Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 18, 2026 05:438,916101,684,51171,106,0002,002,0002,510,848
2Jan 18, 2026 05:198,93498,626,35770,250,0003,010,0002,514,944
3Jan 18, 2026 05:438,93598,643,08072,267,0001,003,0002,461,696
4Jan 18, 2026 05:438,93697,633,60071,269,0002,007,0002,461,696
5Jan 18, 2026 05:198,93794,142,08673,284,00002,514,944
6Jan 18, 2026 05:198,95198,571,05572,397,0001,005,0002,457,600