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 29, 2026 13:11Victor MerckléVictor MerckléScore: 2,752Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 29, 2026 13:122,72330,730,90121,251,0001,080,0002,117,632stderr
2Aug 29, 2026 13:122,74030,605,40121,330,0001,143,0002,117,632stderr
3Aug 29, 2026 13:122,74430,608,69721,387,0001,116,0002,117,632stderr
4Aug 29, 2026 13:122,74930,848,87621,525,0001,023,0002,117,632stderr
5Aug 29, 2026 13:122,75230,706,72621,540,0001,027,0002,117,632stderr
6Aug 29, 2026 13:122,75430,748,08621,573,0001,015,0002,117,632stderr
7Aug 29, 2026 13:125,36452,132,35442,933,0001,059,0002,117,632stderr
8Aug 29, 2026 13:125,37352,427,50843,012,0001,049,0002,117,632stderr
9Aug 29, 2026 13:125,38252,479,65043,092,0001,041,0002,117,632stderr