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 10, 2026 22:32olliecrowolliecrowScore: 3,674Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 10, 2026 22:323,64955,063,14527,929,0001,994,0002,441,216
2Mar 10, 2026 22:323,67456,535,43029,119,0001,004,0002,453,504
3Mar 10, 2026 22:3218,703180,104,026146,350,0007,016,0002,265,088