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 04:34olliecrowolliecrowScore: 12,301Success
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 04:3412,282133,431,60799,717,000997,0002,326,528
2Mar 4, 2026 04:3412,301130,389,30897,843,0003,026,0002,371,584
3Mar 4, 2026 04:3412,304127,916,39098,896,0001,997,0002,310,144