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 listJun 12, 2026 11:33Victor MerckléVictor MerckléScore: 3,416Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 12, 2026 11:343,38436,655,75626,688,0001,066,0002,113,536
2Jun 12, 2026 11:343,38835,405,11826,757,0001,029,0002,113,536
3Jun 12, 2026 11:343,39335,386,88926,769,0001,057,0002,113,536
4Jun 12, 2026 11:343,40835,515,51626,914,0001,032,0002,113,536
5Jun 12, 2026 11:343,41635,527,71926,973,0001,045,0002,113,536
6Jun 12, 2026 11:343,42135,700,41427,022,0001,031,0002,113,536
7Jun 12, 2026 11:343,44335,733,06627,186,0001,048,0002,113,536
8Jun 12, 2026 11:343,45835,965,49327,321,0001,036,0002,113,536
9Jun 12, 2026 11:346,49560,876,80052,248,0001,016,0002,113,536