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 listAug 19, 2026 15:22Victor MerckléVictor MerckléScore: 5,443Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 19, 2026 15:312,77231,110,13221,724,0001,012,0002,117,632stderr
2Aug 19, 2026 15:312,80237,357,12421,941,0001,040,0002,117,632stderr
3Aug 19, 2026 15:315,39552,482,54743,206,0001,039,0002,117,632stderr
4Aug 19, 2026 15:315,43652,937,43143,546,0001,033,0002,117,632stderr
5Aug 19, 2026 15:315,44354,035,24043,491,0001,149,0002,117,632stderr
6Aug 19, 2026 15:315,46352,949,24543,789,0001,015,0002,117,632stderr
7Aug 19, 2026 15:315,57353,821,95144,688,0001,018,0002,117,632stderr
8Aug 19, 2026 15:315,97657,173,78847,978,0001,032,0002,117,632stderr
9Aug 19, 2026 15:3114,397126,191,133116,829,0001,233,0002,117,632stderr