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 listMay 20, 2026 19:01M-RochatM-RochatError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 20, 2026 19:01058,380,34145,955,0002,235,0002,113,536expected "2180469686 ", got "2118037972 "
2May 20, 2026 19:01057,617,89245,929,0002,243,0002,113,536expected "2057778336 ", got "2118053249 "
3May 20, 2026 19:01057,734,61646,127,0002,178,0002,113,536expected "2079596232 ", got "2117993990 "