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 20, 2026 15:05olliecrowolliecrowScore: 21,330Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 20, 2026 15:053,39752,167,50525,869,0001,989,0002,420,736
2Mar 20, 2026 15:0521,330198,977,616172,908,0001,998,0002,322,432
3Mar 20, 2026 15:0521,388201,391,407172,378,0003,006,0002,371,584