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 listOct 14, 2024 00:45zielajzielajError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Oct 5, 2026 20:38Andrew Epstein10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 5, 2026 20:38076,387,91940,799,00026,654,00020,480No answer to stdout. Died or killed?stderr
2Oct 14, 2024 00:455,28064,504,07632,220,00011,075,0002,404,352
3Oct 14, 2024 00:455,40468,018,85536,258,0008,057,0002,445,312
4Oct 14, 2024 00:455,53371,238,55729,241,00016,133,0002,363,392