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 25, 2026 05:46Dominique GarmierDominique GarmierScore: 100,682Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 25, 2026 05:4689,879767,321,896647,126,00089,878,0002,273,280
2Mar 25, 2026 05:46100,682849,551,650738,633,00086,956,0002,506,752
3Mar 25, 2026 05:46100,782852,710,839740,472,00085,938,0002,428,928