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 19, 2026 13:47Dominique GarmierDominique GarmierScore: 13,176Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 19, 2026 13:4713,142136,638,962105,767,0001,995,0002,502,656
2Mar 19, 2026 13:4713,176138,279,379106,040,0002,000,0002,519,040
3Mar 19, 2026 13:4713,177137,573,865107,054,0001,000,0002,326,528