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 listMar 17, 2026 13:38limanjun99limanjun99Score: 115,996Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 17, 2026 13:38115,054966,877,955941,450,0001,996,0002,289,664
2Mar 17, 2026 13:38115,120970,269,466941,987,0001,995,0002,285,568
3Mar 17, 2026 13:38115,470974,554,034945,859,000997,0002,269,184
4Mar 17, 2026 13:38115,542972,943,294945,449,0001,996,0002,265,088
5Mar 17, 2026 13:38115,996974,033,608949,168,0001,996,0002,269,184
6Mar 17, 2026 13:38115,996977,944,959949,170,0001,996,0002,289,664
7Mar 17, 2026 13:38116,034980,085,192950,482,000998,0002,289,664
8Mar 17, 2026 13:38116,092983,699,544949,962,0001,995,0002,289,664
9Mar 17, 2026 13:38116,120979,708,683951,188,000998,0002,289,664