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 listSep 3, 2026 12:52Josu San MartinJosu San MartinScore: 3,506Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 3, 2026 12:553,48338,623,82427,518,0001,047,0002,113,536
2Sep 3, 2026 12:553,48738,610,89627,555,0001,040,0002,113,536
3Sep 3, 2026 12:553,49239,408,84627,543,0001,094,0002,113,536
4Sep 3, 2026 12:553,49639,502,47627,570,0001,104,0002,113,536
5Sep 3, 2026 12:553,50638,704,65627,704,0001,046,0002,113,536
6Sep 3, 2026 12:553,51839,640,01127,760,0001,093,0002,113,536
7Sep 3, 2026 12:553,56839,377,42528,183,0001,078,0002,113,536
8Sep 3, 2026 12:553,60440,347,64128,478,0001,081,0002,113,536
9Sep 3, 2026 12:5514,438129,264,295117,330,0001,068,0002,113,536