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 1, 2026 11:02Victor MerckléVictor MerckléScore: 2,752Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 1, 2026 11:042,72130,652,66121,194,0001,120,0002,117,632stderr
2Sep 1, 2026 11:042,72431,016,12421,315,0001,028,0002,117,632stderr
3Sep 1, 2026 11:042,72631,413,00621,273,0001,081,0002,117,632stderr
4Sep 1, 2026 11:042,73130,859,47621,322,0001,077,0002,117,632stderr
5Sep 1, 2026 11:042,75230,971,60521,486,0001,088,0002,117,632stderr
6Sep 1, 2026 11:045,38752,703,36743,161,0001,013,0002,117,632stderr
7Sep 1, 2026 11:045,38952,631,23843,182,0001,015,0002,117,632stderr
8Sep 1, 2026 11:045,40352,723,06243,291,0001,016,0002,117,632stderr
9Sep 1, 2026 11:045,41352,800,10743,376,0001,016,0002,117,632stderr