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 13:54Victor MerckléVictor MerckléScore: 2,654Success
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 13:552,62329,868,30320,495,0001,015,0002,117,632stderr
2Sep 1, 2026 13:552,62329,925,07220,421,0001,088,0002,117,632stderr
3Sep 1, 2026 13:552,63430,723,04920,566,0001,033,0002,117,632stderr
4Sep 1, 2026 13:552,63529,975,09220,591,0001,019,0002,117,632stderr
5Sep 1, 2026 13:552,65430,845,88720,753,0001,015,0002,117,632stderr
6Sep 1, 2026 13:555,27051,554,59342,053,0001,162,0002,117,632stderr
7Sep 1, 2026 13:555,30152,538,36442,210,0001,263,0002,117,632stderr
8Sep 1, 2026 13:555,30551,891,39142,496,0001,013,0002,117,632stderr
9Sep 1, 2026 13:555,31152,582,67242,286,0001,267,0002,117,632stderr