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 28, 2026 00:25Dominique GarmierDominique GarmierScore: 169,434Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 28, 2026 00:25169,3561,418,147,5111,387,723,000999,0002,514,944
2Mar 28, 2026 00:25169,4341,415,456,0001,387,360,0001,999,0002,338,816
3Mar 28, 2026 00:25171,3601,432,633,9071,403,153,0001,998,0002,301,952