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 14, 2026 18:50marko1597marko1597Score: 56,034Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 14, 2026 19:0355,382464,009,750451,698,0002,442,0002,117,632stderr
2Aug 14, 2026 19:0355,453464,531,315452,341,0002,381,0002,117,632stderr
3Aug 14, 2026 19:0355,476464,887,722452,634,0002,275,0002,117,632stderr
4Aug 14, 2026 19:0355,662466,190,276453,843,0002,589,0002,117,632stderr
5Aug 14, 2026 19:0356,034469,278,824457,067,0002,415,0002,117,632stderr
6Aug 14, 2026 19:0356,410472,350,475460,212,0002,357,0002,117,632stderr
7Aug 14, 2026 19:0356,429472,504,239460,333,0002,390,0002,117,632stderr
8Aug 14, 2026 19:0357,007477,456,675465,291,0002,174,0002,117,632stderr
9Aug 14, 2026 19:0357,153478,569,709466,192,0002,466,0002,117,632stderr