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 listFeb 7, 2026 03:55Josu San MartinJosu San MartinScore: 11,435Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 7, 2026 03:553,59353,345,49627,434,0002,032,0002,478,080
2Feb 7, 2026 03:5511,435123,990,25391,771,0001,995,0002,465,792
3Feb 7, 2026 03:5511,533124,127,87693,575,000995,0002,355,200