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 listJun 16, 2026 15:36Maya RebholzMaya RebholzError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Oct 5, 2026 21:19Andrew Epstein10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 5, 2026 21:22096,315,11248,954,00036,816,00020,480No answer to stdout. Died or killed?
2Jun 16, 2026 15:37122,8571,016,752,677968,464,00038,966,0002,117,632
3Jun 16, 2026 15:37125,9861,042,430,317993,795,00039,291,0002,117,632
4Jun 16, 2026 15:37128,3701,061,940,4431,013,344,00039,293,0002,117,632
5Jun 16, 2026 15:37132,9921,099,760,6591,051,236,00039,306,0002,117,632
6Jun 16, 2026 15:37133,0551,100,322,4481,053,732,00037,320,0002,117,632
7Jun 16, 2026 15:37134,9631,115,982,9241,067,332,00039,371,0002,117,632
8Jun 16, 2026 15:37136,3461,127,692,3521,080,685,00037,354,0002,117,632
9Jun 16, 2026 15:37141,2831,167,914,6831,119,556,00038,966,0002,117,632
10Jun 16, 2026 15:37144,4821,194,078,8201,145,832,00038,926,0002,117,632