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 listJun 23, 2026 21:24Victor MerckléVictor MerckléScore: 3,117Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 23, 2026 21:253,04032,568,45223,726,0001,202,0002,117,632stderr
2Jun 23, 2026 21:253,04632,647,06523,866,0001,117,0002,117,632stderr
3Jun 23, 2026 21:253,05132,647,74523,796,0001,223,0002,117,632stderr
4Jun 23, 2026 21:253,07332,930,08924,003,0001,197,0002,117,632stderr
5Jun 23, 2026 21:253,11733,202,52824,338,0001,223,0002,117,632stderr
6Jun 23, 2026 21:2511,999106,026,05897,384,0001,009,0002,117,632stderr
7Jun 23, 2026 21:2512,008106,095,45097,461,0001,011,0002,117,632stderr
8Jun 23, 2026 21:2512,035106,304,29597,681,0001,010,0002,117,632stderr
9Jun 23, 2026 21:2512,056106,311,19197,849,0001,011,0002,117,632stderr