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 19, 2026 10:04Victor MerckléVictor MerckléScore: 5,506Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 19, 2026 10:092,88831,933,22622,628,0001,056,0002,117,632stderr
2Aug 19, 2026 10:092,89732,063,71922,688,0001,072,0002,117,632stderr
3Aug 19, 2026 10:092,90132,825,46122,729,0001,064,0002,117,632stderr
4Aug 19, 2026 10:092,91432,176,82022,871,0001,028,0002,117,632stderr
5Aug 19, 2026 10:095,50653,406,98243,128,0002,022,0002,117,632stderr
6Aug 19, 2026 10:095,51953,623,08943,187,0002,073,0002,117,632stderr
7Aug 19, 2026 10:095,52853,578,58744,307,0001,023,0002,117,632stderr
8Aug 19, 2026 10:095,58954,177,63244,802,0001,029,0002,117,632stderr
9Aug 19, 2026 10:095,59154,150,19043,832,0002,018,0002,117,632stderr