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 30, 2026 07:28Dominique GarmierDominique GarmierError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 5, 2026 13:36Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 5, 2026 13:37012,418,6151,585,0001,584,00024,576No answer to stdout. Died or killed?
2Mar 30, 2026 07:283,79852,374,24129,131,0002,009,0002,371,584
3Mar 30, 2026 07:283,85057,256,60230,551,0001,018,0002,322,432
4Mar 30, 2026 07:2813,143139,106,805102,787,0004,989,0002,498,560