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 12:15marko1597marko1597Score: 7,526Success
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 12:312,69130,394,57521,046,0001,028,0002,117,632stderr
2Aug 16, 2026 12:312,69630,411,48721,083,0001,027,0002,117,632stderr
3Aug 16, 2026 12:312,72230,677,79521,199,0001,126,0002,117,632stderr
4Aug 16, 2026 12:312,73030,754,78121,267,0001,123,0002,117,632stderr
5Aug 16, 2026 12:317,52670,038,23560,550,0001,170,0002,117,632stderr
6Aug 16, 2026 12:317,55870,320,65160,821,0001,157,0002,117,632stderr
7Aug 16, 2026 12:317,58770,499,58361,187,0001,032,0002,117,632stderr
8Aug 16, 2026 12:317,60370,662,12061,189,0001,157,0002,117,632stderr
9Aug 16, 2026 12:317,69771,442,56062,061,0001,059,0002,117,632stderr