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 19, 2026 18:07Andrew EpsteinAndrew EpsteinScore: 45,376Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 19, 2026 18:0830,455260,877,420248,734,0001,005,0002,117,632stderr
2Sep 19, 2026 18:0830,524260,756,505249,299,0001,004,0002,117,632stderr
3Sep 19, 2026 18:0845,217381,702,318368,743,0002,042,0002,117,632stderr
4Sep 19, 2026 18:0845,349383,064,743370,862,0001,004,0002,117,632stderr
5Sep 19, 2026 18:0845,376383,165,806371,085,0001,002,0002,117,632stderr
6Sep 19, 2026 18:0845,411383,608,478371,367,0001,004,0002,117,632stderr
7Sep 19, 2026 18:0845,592384,984,488372,854,0001,004,0002,117,632stderr
8Sep 19, 2026 18:0845,858386,487,421375,035,0001,003,0002,117,632stderr
9Sep 19, 2026 18:0846,083388,988,952376,884,0001,003,0002,117,632stderr