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 29, 2026 12:52Victor MerckléVictor MerckléScore: 2,822Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 29, 2026 12:542,72230,657,17521,236,0001,091,0002,117,632stderr
2Aug 29, 2026 12:542,74530,675,43521,501,0001,013,0002,117,632stderr
3Aug 29, 2026 12:542,75030,912,85321,532,0001,026,0002,117,632stderr
4Aug 29, 2026 12:542,76930,896,89521,597,0001,112,0002,117,632stderr
5Aug 29, 2026 12:542,82231,227,32822,034,0001,112,0002,117,632stderr
6Aug 29, 2026 12:545,38652,323,09343,143,0001,023,0002,117,632stderr
7Aug 29, 2026 12:545,38853,283,92843,054,0001,128,0002,117,632stderr
8Aug 29, 2026 12:545,45853,626,65343,667,0001,093,0002,117,632stderr
9Aug 29, 2026 12:545,57154,028,52644,645,0001,039,0002,117,632stderr