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 listSep 3, 2026 05:05Josu San MartinJosu San MartinScore: 3,602Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 3, 2026 05:063,58040,152,95228,302,0001,061,0002,113,536
2Sep 3, 2026 05:063,58039,369,83928,304,0001,059,0002,113,536
3Sep 3, 2026 05:063,59539,736,78328,419,0001,060,0002,113,536
4Sep 3, 2026 05:063,60241,140,39728,471,0001,067,0002,113,536
5Sep 3, 2026 05:063,60239,602,77028,509,0001,034,0002,113,536
6Sep 3, 2026 05:069,62888,979,86274,598,0004,352,0002,113,536
7Sep 3, 2026 05:069,73489,849,03574,635,0005,186,0002,113,536
8Sep 3, 2026 05:0610,33894,987,77379,545,0005,234,0002,113,536
9Sep 3, 2026 05:0611,252102,295,73385,972,0006,297,0002,113,536