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 listAug 16, 2026 09:22marko1597marko1597Score: 7,420Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 16, 2026 09:492,83231,530,01722,063,0001,165,0002,117,632stderr
2Aug 16, 2026 09:492,85631,729,99822,131,0001,292,0002,117,632stderr
3Aug 16, 2026 09:492,86233,027,19322,187,0001,284,0002,117,632stderr
4Aug 16, 2026 09:497,28068,015,14158,564,0001,138,0002,117,632stderr
5Aug 16, 2026 09:497,42069,206,51359,666,0001,179,0002,117,632stderr
6Aug 16, 2026 09:497,48269,662,31660,237,0001,121,0002,117,632stderr
7Aug 16, 2026 09:497,52369,975,48560,557,0001,132,0002,117,632stderr
8Aug 16, 2026 09:497,52870,067,12360,599,0001,132,0002,117,632stderr
9Aug 16, 2026 09:497,54870,858,78760,735,0001,166,0002,117,632stderr