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 listApr 20, 2026 16:06olliecrowolliecrowScore: 21,353Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 20, 2026 16:0716,024159,207,789130,394,0001,003,0002,367,488
2Apr 20, 2026 16:0721,353197,182,874171,098,0004,002,0002,306,048
3Apr 20, 2026 16:0721,434190,399,315172,767,0002,995,0002,478,080