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 5, 2022 10:27Eugene ZhydzetskiEugene ZhydzetskiError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Sep 9, 2026 10:30Tomislav Tunkovic10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 9, 2026 10:300228,441,484210,244,0007,845,00045,056expected "4294967295 ", got "0 "
2Sep 9, 2026 10:300231,359,669213,259,0009,276,00045,056expected "4294967295 ", got "0 "
3Sep 9, 2026 10:300229,030,967212,731,0007,533,00045,056expected "4294967233 ", got "0 "
4Sep 5, 2022 10:2722,037243,492,503180,706,37702,183,168
5Sep 5, 2022 10:2722,043243,942,146180,756,07302,187,264
6Sep 5, 2022 10:2722,206250,172,870182,091,17802,187,264