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 10:21Victor MerckléVictor MerckléScore: 2,755Success
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 10:222,74530,730,16621,494,0001,021,0002,117,632stderr
2Sep 1, 2026 10:222,74630,688,20721,499,0001,023,0002,117,632stderr
3Sep 1, 2026 10:222,74730,903,23321,479,0001,051,0002,117,632stderr
4Sep 1, 2026 10:222,75531,000,56021,474,0001,124,0002,117,632stderr
5Sep 1, 2026 10:222,75531,156,17121,548,0001,050,0002,117,632stderr
6Sep 1, 2026 10:222,76131,059,65221,433,0001,209,0002,117,632stderr
7Sep 1, 2026 10:222,76230,798,05521,511,0001,141,0002,117,632stderr
8Sep 1, 2026 10:225,38152,538,86142,924,0001,206,0002,117,632stderr
9Sep 1, 2026 10:225,38652,290,79043,153,0001,013,0002,117,632stderr