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 12:52marko1597marko1597Score: 6,964Success
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 12:542,71530,438,20621,238,0001,033,0002,117,632stderr
2Aug 16, 2026 12:542,72430,773,52621,318,0001,020,0002,117,632stderr
3Aug 16, 2026 12:546,38860,853,89451,355,0001,031,0002,117,632stderr
4Aug 16, 2026 12:546,85464,511,09255,126,0001,079,0002,117,632stderr
5Aug 16, 2026 12:546,96465,339,78755,952,0001,153,0002,117,632stderr
6Aug 16, 2026 12:546,99265,728,41556,178,0001,158,0002,117,632stderr
7Aug 16, 2026 12:547,03166,147,27056,474,0001,181,0002,117,632stderr
8Aug 16, 2026 12:547,05165,978,52356,798,0001,025,0002,117,632stderr
9Aug 16, 2026 12:547,12466,881,30457,392,0001,029,0002,117,632stderr