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 9, 2026 08:05Pavel SkripkinPavel SkripkinError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 9, 2026 08:06059,418,19937,207,0008,668,0002,396,160expected "1997359267 ", got " "
2May 9, 2026 08:065,53060,657,62936,855,0008,491,0002,490,368
3May 9, 2026 08:065,84963,717,37638,741,0009,226,0002,306,048