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 4, 2026 22:42olliecrowolliecrowScore: 12,140Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 4, 2026 22:4212,134126,521,28597,486,0002,010,0002,514,944
2Mar 4, 2026 22:4212,140125,332,48098,541,0001,005,0002,416,640
3Mar 4, 2026 22:4212,166128,413,93297,763,0001,995,0002,416,640