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 6, 2026 23:22olliecrowolliecrowScore: 3,437Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 6, 2026 23:223,43657,758,77227,169,0001,006,0002,330,624
2Apr 6, 2026 23:223,43753,640,88325,167,0003,020,0002,473,984
3Apr 6, 2026 23:223,44353,058,97926,219,0002,016,0002,408,448