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 16:23Victor MerckléVictor MerckléScore: 3,418Success
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 16:243,27334,943,07425,682,0001,161,0002,117,632stderr
2Aug 23, 2026 16:243,27534,990,17425,838,0001,024,0002,117,632stderr
3Aug 23, 2026 16:243,28835,128,18725,941,0001,025,0002,117,632stderr
4Aug 23, 2026 16:243,35635,708,48926,345,0001,176,0002,117,632stderr
5Aug 23, 2026 16:243,41836,308,15926,926,0001,109,0002,117,632stderr
6Aug 23, 2026 16:245,91656,684,98847,402,0001,115,0002,117,632stderr
7Aug 23, 2026 16:245,94557,064,30347,628,0001,121,0002,117,632stderr
8Aug 23, 2026 16:245,95557,085,43147,691,0001,143,0002,117,632stderr
9Aug 23, 2026 16:245,96957,157,01947,922,0001,026,0002,117,632stderr