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 listSep 3, 2026 05:58Josu San MartinJosu San MartinScore: 3,410Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 3, 2026 05:593,39237,732,05626,783,0001,034,0002,117,632
2Sep 3, 2026 05:593,40637,953,39326,869,0001,067,0002,117,632
3Sep 3, 2026 05:593,40937,998,48825,917,0002,038,0002,117,632
4Sep 3, 2026 05:593,40937,869,98426,921,0001,038,0002,117,632
5Sep 3, 2026 05:593,41037,995,71725,924,0002,038,0002,117,632
6Sep 3, 2026 05:593,43538,059,70827,138,0001,037,0002,117,632
7Sep 3, 2026 05:5911,429103,690,75891,675,0002,048,0002,117,632
8Sep 3, 2026 05:5911,477104,090,56792,088,0002,025,0002,117,632
9Sep 3, 2026 05:5911,535104,581,07492,579,0002,010,0002,117,632