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 29, 2026 16:17Dominique GarmierDominique GarmierScore: 212,922Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 29, 2026 16:17211,4101,761,733,6431,732,564,000999,0002,514,944
2Mar 29, 2026 16:17212,9221,777,054,2321,744,963,000999,0002,514,944
3Mar 29, 2026 16:17213,7701,784,433,8901,751,916,000999,0002,379,776