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 15, 2026 22:13marko1597marko1597Score: 108,157Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 15, 2026 22:36105,330873,572,109853,992,0009,717,0002,117,632stderr
2Aug 15, 2026 22:36106,868886,221,410866,350,0009,974,0002,117,632stderr
3Aug 15, 2026 22:36107,080887,959,102868,554,0009,510,0002,117,632stderr
4Aug 15, 2026 22:36107,892894,621,443874,221,00010,500,0002,117,632stderr
5Aug 15, 2026 22:36108,157896,823,181877,221,0009,671,0002,117,632stderr
6Aug 15, 2026 22:36108,567900,136,272880,914,0009,343,0002,117,632stderr
7Aug 15, 2026 22:36108,572900,192,965879,853,00010,444,0002,117,632stderr
8Aug 15, 2026 22:36110,952919,769,579899,276,00010,532,0002,117,632stderr
9Aug 15, 2026 22:36111,833928,199,588906,572,00010,462,0002,117,632stderr