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 4, 2026 07:18olliecrowolliecrowScore: 12,144Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 4, 2026 07:1812,135126,501,57297,499,0002,010,0002,461,696
2Mar 4, 2026 07:2312,135127,392,79497,497,0002,010,0002,424,832
3Mar 4, 2026 07:2312,142123,220,39598,563,0001,005,0002,461,696
4Mar 4, 2026 07:1812,144132,838,68196,562,0003,017,0002,396,160
5Mar 4, 2026 07:2312,160128,411,90897,718,0001,994,0002,420,736
6Mar 4, 2026 07:1812,206131,484,21198,087,0002,001,0002,322,432