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 23, 2026 15:17Victor MerckléVictor MerckléScore: 5,615Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 23, 2026 15:182,96132,517,42023,188,0001,093,0002,117,632stderr
2Aug 23, 2026 15:182,96333,348,43123,291,0001,013,0002,117,632stderr
3Aug 23, 2026 15:182,96932,602,94523,332,0001,016,0002,117,632stderr
4Aug 23, 2026 15:185,60854,221,66044,875,0001,116,0002,117,632stderr
5Aug 23, 2026 15:185,61554,339,40544,917,0001,131,0002,117,632stderr
6Aug 23, 2026 15:185,62055,389,33444,945,0001,147,0002,117,632stderr
7Aug 23, 2026 15:185,62855,185,01245,030,0001,125,0002,117,632stderr
8Aug 23, 2026 15:185,64254,551,82945,258,0001,014,0002,117,632stderr
9Aug 23, 2026 15:185,83756,156,83546,849,0001,016,0002,117,632stderr