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 18:01Victor MerckléVictor MerckléScore: 5,510Success
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 18:032,87231,922,54822,524,0001,030,0002,117,632stderr
2Aug 23, 2026 18:032,88131,957,00622,600,0001,028,0002,117,632stderr
3Aug 23, 2026 18:032,88531,973,30422,629,0001,028,0002,117,632stderr
4Aug 23, 2026 18:032,89132,115,94522,686,0001,023,0002,117,632stderr
5Aug 23, 2026 18:035,51053,623,13244,164,0001,018,0002,117,632stderr
6Aug 23, 2026 18:035,55153,910,05244,499,0001,021,0002,117,632stderr
7Aug 23, 2026 18:035,58054,141,05844,742,0001,020,0002,117,632stderr
8Aug 23, 2026 18:035,59454,223,61343,869,0002,006,0002,117,632stderr
9Aug 23, 2026 18:035,65955,940,03145,387,0001,021,0002,117,632stderr