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 listSep 1, 2026 14:00Victor MerckléVictor MerckléScore: 3,066Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 1, 2026 14:013,04033,245,62823,882,0001,051,0002,117,632stderr
2Sep 1, 2026 14:013,04533,319,94923,906,0001,067,0002,117,632stderr
3Sep 1, 2026 14:013,05233,396,55423,966,0001,064,0002,117,632stderr
4Sep 1, 2026 14:013,05633,406,34324,053,0001,013,0002,117,632stderr
5Sep 1, 2026 14:013,06633,273,66624,114,0001,029,0002,117,632stderr
6Sep 1, 2026 14:015,70355,079,98345,751,0001,014,0002,117,632stderr
7Sep 1, 2026 14:015,72255,328,90945,687,0001,241,0002,117,632stderr
8Sep 1, 2026 14:015,72755,283,82345,798,0001,169,0002,117,632stderr
9Sep 1, 2026 14:015,82258,427,07446,722,0001,019,0002,117,632stderr