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 4, 2026 09:25Victor MerckléVictor MerckléScore: 2,617Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 4, 2026 09:272,60629,676,22420,317,0001,060,0002,117,632stderr
2Sep 4, 2026 09:272,61129,598,10820,361,0001,056,0002,117,632stderr
3Sep 4, 2026 09:272,61530,563,79720,309,0001,141,0002,117,632stderr
4Sep 4, 2026 09:272,61529,807,84220,362,0001,081,0002,117,632stderr
5Sep 4, 2026 09:272,61729,757,58920,392,0001,070,0002,117,632stderr
6Sep 4, 2026 09:272,62429,832,05220,467,0001,053,0002,117,632stderr
7Sep 4, 2026 09:275,26351,667,54741,995,0001,169,0002,117,632stderr
8Sep 4, 2026 09:275,29151,517,83942,246,0001,148,0002,117,632stderr
9Sep 4, 2026 09:275,29551,778,91242,218,0001,206,0002,117,632stderr