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:31Victor MerckléVictor MerckléScore: 5,390Success
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:352,73730,559,16321,435,0001,013,0002,117,632stderr
2Aug 29, 2026 12:352,74130,839,39621,470,0001,010,0002,117,632stderr
3Aug 29, 2026 12:352,75230,935,40421,546,0001,025,0002,117,632stderr
4Aug 29, 2026 12:355,38052,445,03243,058,0001,059,0002,117,632stderr
5Aug 29, 2026 12:355,39052,540,04543,065,0001,135,0002,117,632stderr
6Aug 29, 2026 12:355,41752,837,87643,285,0001,141,0002,117,632stderr
7Aug 29, 2026 12:355,42052,580,37543,323,0001,121,0002,117,632stderr
8Aug 29, 2026 12:355,43852,688,27243,460,0001,134,0002,117,632stderr
9Aug 29, 2026 12:355,50653,465,06544,126,0001,024,0002,117,632stderr