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 21:10olliecrowolliecrowScore: 10,320Success
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 21:1010,276103,316,99382,261,0002,006,0002,457,600
2Mar 10, 2026 21:1010,320109,498,32981,600,0003,022,0002,318,336
3Mar 10, 2026 21:1010,383113,762,47482,135,0003,004,0002,289,664