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 listMay 7, 2026 18:17Pavel SkripkinPavel SkripkinScore: 11,948Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 7, 2026 18:1811,930111,946,97596,819,0001,014,0002,412,544stderr
2May 7, 2026 18:1811,941111,843,99796,905,0001,014,0002,412,544stderr
3May 7, 2026 18:1811,944114,329,00096,930,0001,014,0002,404,352stderr
4May 7, 2026 18:1811,947112,743,44996,952,0001,014,0002,412,544stderr
5May 7, 2026 18:1811,948111,152,54796,964,0001,014,0002,404,352stderr
6May 7, 2026 18:1811,955115,539,58097,020,0001,014,0002,400,256stderr
7May 7, 2026 18:1811,957111,838,67497,038,0001,014,0002,314,240stderr
8May 7, 2026 18:1811,965113,773,84297,104,0001,014,0002,404,352stderr
9May 7, 2026 18:1812,038115,962,67097,700,0001,013,0002,404,352stderr