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 31, 2026 14:22Victor MerckléVictor MerckléScore: 5,404Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 31, 2026 14:232,72330,442,96221,224,0001,106,0002,117,632stderr
2Aug 31, 2026 14:232,73230,591,14821,294,0001,112,0002,117,632stderr
3Aug 31, 2026 14:232,76231,697,94621,633,0001,017,0002,117,632stderr
4Aug 31, 2026 14:235,37753,016,59343,048,0001,049,0002,117,632stderr
5Aug 31, 2026 14:235,40452,434,24643,251,0001,069,0002,117,632stderr
6Aug 31, 2026 14:235,41752,730,57743,397,0001,025,0002,117,632stderr
7Aug 31, 2026 14:235,42952,827,05943,395,0001,124,0002,117,632stderr
8Aug 31, 2026 14:235,42952,643,48343,419,0001,099,0002,117,632stderr
9Aug 31, 2026 14:235,45854,949,30243,619,0001,142,0002,117,632stderr