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 27, 2026 16:18Victor MerckléVictor MerckléScore: 12,080Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 27, 2026 16:213,21035,650,55925,190,0001,140,0002,174,976
2Jun 27, 2026 16:213,22135,596,29525,269,0001,144,0002,174,976
3Jun 27, 2026 16:213,23435,699,04225,385,0001,136,0002,129,920
4Jun 27, 2026 16:213,28736,288,04825,822,0001,137,0002,129,920
5Jun 27, 2026 16:2112,080108,294,46296,927,0002,135,0002,174,976
6Jun 27, 2026 16:2112,082108,274,89896,732,0002,344,0002,134,016
7Jun 27, 2026 16:2112,115108,548,20096,997,0002,352,0002,129,920
8Jun 27, 2026 16:2112,271109,813,47498,497,0002,127,0002,174,976
9Jun 27, 2026 16:2112,325110,311,34598,936,0002,130,0002,129,920