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 listOct 1, 2026 21:04C21C21Score: 3,332Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 1, 2026 21:053,30238,084,43926,024,0001,059,0002,117,632stderr
2Oct 1, 2026 21:053,30537,774,08226,041,0001,067,0002,117,632stderr
3Oct 1, 2026 21:053,32438,515,76925,202,0002,055,0002,117,632stderr
4Oct 1, 2026 21:053,32938,444,51825,261,0002,039,0002,117,632stderr
5Oct 1, 2026 21:053,33237,928,92425,272,0002,052,0002,117,632stderr
6Oct 1, 2026 21:053,34438,618,26225,254,0002,171,0002,117,632stderr
7Oct 1, 2026 21:053,36038,808,62425,371,0002,185,0002,117,632stderr
8Oct 1, 2026 21:053,36538,204,44425,497,0002,097,0002,117,632stderr
9Oct 1, 2026 21:053,39438,630,83025,637,0002,198,0002,117,632stderr