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:11Andrew EpsteinAndrew EpsteinScore: 59,433Success
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:1259,110495,282,315482,699,0002,006,0002,117,632stderr
2Sep 19, 2026 18:1259,141495,412,127482,914,0002,045,0002,117,632stderr
3Sep 19, 2026 18:1259,276496,539,112485,061,0001,003,0002,117,632stderr
4Sep 19, 2026 18:1259,308497,360,835485,323,0001,006,0002,117,632stderr
5Sep 19, 2026 18:1259,433497,743,739485,345,0002,009,0002,117,632stderr
6Sep 19, 2026 18:1273,940616,927,191605,305,0001,003,0002,117,632stderr
7Sep 19, 2026 18:1274,140618,376,498605,938,0002,014,0002,117,632stderr
8Sep 19, 2026 18:1274,617622,375,516609,863,0002,003,0002,117,632stderr
9Sep 19, 2026 18:1275,127626,767,816613,929,0002,116,0002,117,632stderr