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 18, 2026 04:34limanjun99limanjun99Score: 108,757Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 18, 2026 04:3498,688834,722,077685,358,000123,884,0002,273,280
2Mar 18, 2026 04:34108,757920,699,585757,984,000133,820,0002,273,280
3Mar 18, 2026 04:34124,5611,045,424,393892,476,000128,924,0002,285,568