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 11:49marko1597marko1597Score: 2,753Success
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 11:562,73630,805,40321,322,0001,116,0002,117,632stderr
2Aug 16, 2026 11:562,73830,676,89021,389,0001,065,0002,117,632stderr
3Aug 16, 2026 11:562,74330,708,90421,387,0001,110,0002,117,632stderr
4Aug 16, 2026 11:562,74730,835,64321,411,0001,119,0002,117,632stderr
5Aug 16, 2026 11:562,75330,777,63821,561,0001,014,0002,117,632stderr
6Aug 16, 2026 11:562,81231,344,39922,008,0001,052,0002,117,632stderr
7Aug 16, 2026 11:567,71371,506,83062,098,0001,154,0002,117,632stderr
8Aug 16, 2026 11:567,73271,650,74562,373,0001,036,0002,117,632stderr
9Aug 16, 2026 11:567,74571,821,04562,475,0001,038,0002,117,632stderr