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 19, 2026 01:33zielajzielajScore: 5,279Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 19, 2026 01:335,23571,245,38940,929,0001,996,0002,473,984
2Apr 19, 2026 01:335,27972,868,88940,267,0003,020,0002,465,792
3Apr 19, 2026 01:335,28972,379,16142,358,0001,008,0002,498,560