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 17:19Andrew EpsteinAndrew EpsteinScore: 25,604Success
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 17:2025,347218,952,000205,840,0002,009,0002,117,632stderr
2Sep 19, 2026 17:2025,364218,496,900204,986,0003,006,0002,117,632stderr
3Sep 19, 2026 17:2025,499219,473,226206,069,0003,023,0002,117,632stderr
4Sep 19, 2026 17:2025,543219,874,538207,448,0002,011,0002,117,632stderr
5Sep 19, 2026 17:2025,604221,001,995206,895,0003,059,0002,117,632stderr
6Sep 19, 2026 17:2025,641220,706,635207,190,0003,069,0002,117,632stderr
7Sep 19, 2026 17:2025,655220,783,896207,360,0003,013,0002,117,632stderr
8Sep 19, 2026 17:2025,750221,582,694208,079,0003,075,0002,117,632stderr
9Sep 19, 2026 17:2025,780222,676,992208,242,0003,156,0002,117,632stderr