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 14, 2026 02:11Yuriy LyfenkoYuriy LyfenkoScore: 3,617Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 14, 2026 02:113,54955,419,85127,094,0002,007,0002,465,792
2Apr 14, 2026 02:113,61755,235,32428,637,0001,022,0002,400,256
3Apr 14, 2026 02:113,65954,877,97529,003,0001,000,0002,297,856