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 21, 2026 04:50Yuriy LyfenkoYuriy LyfenkoScore: 4,097Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 21, 2026 04:504,070555,178,53632,367,0001,011,0002,506,752
2Mar 21, 2026 04:504,073557,016,73132,385,0001,012,0002,269,184
3Mar 21, 2026 04:504,092560,795,58832,535,0001,016,0002,396,160
4Mar 21, 2026 04:504,097566,046,84532,580,0001,018,0002,461,696
5Mar 21, 2026 04:504,155564,731,68131,064,0003,006,0002,392,064
6Mar 21, 2026 04:504,422569,178,72735,250,0001,007,0002,523,136