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 listOct 24, 2025 15:29Daniel MastalerzDaniel MastalerzScore: 27,535Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 24, 2025 15:2927,341250,976,273221,194,0003,002,0002,269,184
2Oct 24, 2025 15:2927,423249,345,249222,872,0001,998,0002,404,352
3Oct 24, 2025 15:2927,462253,613,757225,192,00002,269,184
4Oct 24, 2025 15:2927,494248,804,935223,454,0001,995,0002,260,992
5Oct 24, 2025 15:2927,535257,194,800222,787,0002,997,0002,396,160
6Oct 24, 2025 15:2927,667253,238,007224,870,0001,998,0002,396,160
7Oct 24, 2025 15:2927,716254,139,549225,266,0002,002,0002,269,184
8Oct 24, 2025 15:2927,722256,540,604227,322,00002,396,160
9Oct 24, 2025 15:2927,732259,835,954227,403,00002,400,256