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 18, 2026 14:55Victor MerckléVictor MerckléScore: 11,647Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 18, 2026 14:562,84431,596,96822,197,0001,125,0002,117,632stderr
2Aug 18, 2026 14:562,85232,284,29222,369,0001,019,0002,117,632stderr
3Aug 18, 2026 14:562,88632,014,85022,597,0001,070,0002,117,632stderr
4Aug 18, 2026 14:5611,607103,420,57794,143,0001,038,0002,117,632stderr
5Aug 18, 2026 14:5611,647103,828,76394,368,0001,143,0002,117,632stderr
6Aug 18, 2026 14:5611,706105,020,43594,858,0001,138,0002,117,632stderr
7Aug 18, 2026 14:5611,733104,526,19295,086,0001,126,0002,117,632stderr
8Aug 18, 2026 14:5611,844106,725,88295,925,0001,202,0002,117,632stderr
9Aug 18, 2026 14:5611,880105,792,42896,217,0001,200,0002,117,632stderr