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:13marko1597marko1597Score: 6,960Success
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:222,74431,554,61521,386,0001,121,0002,117,632stderr
2Aug 16, 2026 11:222,74931,614,51521,424,0001,123,0002,117,632stderr
3Aug 16, 2026 11:222,77831,855,75521,508,0001,279,0002,117,632stderr
4Aug 16, 2026 11:222,78231,289,10621,667,0001,147,0002,117,632stderr
5Aug 16, 2026 11:226,96066,126,13956,045,0001,029,0002,117,632stderr
6Aug 16, 2026 11:227,01665,935,71556,508,0001,028,0002,117,632stderr
7Aug 16, 2026 11:227,06567,137,80456,895,0001,045,0002,117,632stderr
8Aug 16, 2026 11:227,09567,774,81457,150,0001,036,0002,117,632stderr
9Aug 16, 2026 11:227,10566,703,18957,230,0001,034,0002,117,632stderr