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 22, 2026 02:14Victor MerckléVictor MerckléScore: 3,411Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 22, 2026 02:153,35435,148,75326,464,0001,042,0002,113,536
2Jun 22, 2026 02:153,35835,114,77126,482,0001,059,0002,113,536
3Jun 22, 2026 02:153,38935,377,22226,738,0001,058,0002,113,536
4Jun 22, 2026 02:153,39035,277,53726,744,0001,056,0002,113,536
5Jun 22, 2026 02:153,41135,484,06826,942,0001,032,0002,113,536
6Jun 22, 2026 02:153,46435,922,39327,377,0001,035,0002,113,536
7Jun 22, 2026 02:156,21058,339,20549,908,0001,015,0002,113,536
8Jun 22, 2026 02:156,27959,012,49350,467,0001,022,0002,113,536
9Jun 22, 2026 02:156,57361,455,28352,890,0001,016,0002,113,536