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 26, 2026 07:50e1011e1011Score: 101,783Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 26, 2026 07:5173,467613,454,351461,636,000140,798,0002,113,536
2Oct 26, 2026 07:5179,850667,527,812512,582,000142,190,0002,113,536
3Oct 26, 2026 07:5181,772681,625,437533,394,000137,144,0002,113,536
4Oct 26, 2026 07:51101,491843,789,053689,734,000142,495,0002,113,536
5Oct 26, 2026 07:51101,783845,635,089693,553,000141,069,0002,113,536
6Oct 26, 2026 07:51104,487868,266,065716,168,000140,633,0002,113,536
7Oct 26, 2026 07:51108,160898,104,016749,215,000137,704,0002,113,536
8Oct 26, 2026 07:51108,481901,176,120751,826,000137,726,0002,113,536
9Oct 26, 2026 07:51118,652983,993,066830,836,000142,118,0002,113,536