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 listMar 20, 2026 14:13olliecrowolliecrowScore: 21,141Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 20, 2026 14:133,25151,456,80124,607,0002,050,0002,412,544
2Mar 20, 2026 14:1321,141200,273,757168,343,0005,010,0002,404,352
3Mar 20, 2026 14:1321,151201,013,469170,429,0003,007,0002,306,048