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 listJan 18, 2026 05:49Josu San MartinJosu San MartinScore: 8,766Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 18, 2026 05:498,75599,580,17870,798,000997,0002,510,848
2Jan 18, 2026 05:498,76096,940,27969,837,0001,995,0002,457,600
3Jan 18, 2026 05:498,76096,716,50869,838,0001,995,0002,510,848
4Jan 18, 2026 05:498,766106,335,22070,880,000998,0002,453,504
5Jan 18, 2026 05:498,76697,792,20469,883,0001,996,0002,502,656
6Jan 18, 2026 05:498,771100,726,75669,927,0001,997,0002,494,464
7Jan 18, 2026 05:498,772104,255,18970,932,000999,0002,465,792
8Jan 18, 2026 05:498,781101,287,56871,007,0001,000,0002,514,944
9Jan 18, 2026 05:498,91896,917,21071,127,0002,003,0002,445,312