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 26, 2026 21:33Dominique GarmierDominique GarmierScore: 10,030Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 26, 2026 21:337,05982,476,55354,887,0002,993,0002,379,776
2Mar 26, 2026 21:3310,030105,038,07880,244,0002,006,0002,342,912
3Mar 26, 2026 21:3310,100108,575,95080,825,0001,995,0002,314,240