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:14marko1597marko1597Score: 2,788Success
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:232,73030,679,96321,365,0001,029,0002,117,632stderr
2Aug 16, 2026 11:232,74930,750,64321,514,0001,031,0002,117,632stderr
3Aug 16, 2026 11:232,76430,928,04921,498,0001,174,0002,117,632stderr
4Aug 16, 2026 11:232,76731,861,73821,586,0001,110,0002,117,632stderr
5Aug 16, 2026 11:232,78831,132,90721,757,0001,111,0002,117,632stderr
6Aug 16, 2026 11:237,59770,631,12961,272,0001,031,0002,117,632stderr
7Aug 16, 2026 11:237,72271,627,19362,288,0001,033,0002,117,632stderr
8Aug 16, 2026 11:237,73071,704,63662,359,0001,034,0002,117,632stderr
9Aug 16, 2026 11:237,74973,059,30062,374,0001,171,0002,117,632stderr