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 23:05olliecrowolliecrowScore: 18,386Success
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 23:0518,344180,366,437149,420,0001,002,0002,301,952
2Mar 4, 2026 23:0518,386175,855,503148,766,0001,996,0002,273,280
3Mar 4, 2026 23:0518,414177,929,322147,997,0002,999,0002,306,048