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 21, 2026 22:18Dominique GarmierDominique GarmierScore: 23,559Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 21, 2026 22:1823,128217,333,56690,832,00098,817,0002,338,816
2Mar 21, 2026 22:1823,559218,826,77894,089,00099,094,0002,514,944
3Mar 21, 2026 22:1823,636226,465,11685,919,000107,898,0002,506,752