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 listJul 4, 2026 06:29Victor MerckléVictor MerckléScore: 2,907Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 4, 2026 06:302,85531,339,13422,396,0001,023,0002,117,632stderr
2Jul 4, 2026 06:302,86831,483,68422,488,0001,036,0002,117,632stderr
3Jul 4, 2026 06:302,87931,653,21022,469,0001,141,0002,117,632stderr
4Jul 4, 2026 06:302,88731,641,29822,636,0001,038,0002,117,632stderr
5Jul 4, 2026 06:302,90731,750,43622,794,0001,048,0002,117,632stderr
6Jul 4, 2026 06:302,90931,810,71722,817,0001,042,0002,117,632stderr
7Jul 4, 2026 06:302,95232,105,44023,170,0001,040,0002,117,632stderr
8Jul 4, 2026 06:3011,707103,946,42994,974,0001,029,0002,117,632stderr
9Jul 4, 2026 06:3011,795104,660,86195,597,0001,126,0002,117,632stderr