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 listSep 8, 2026 16:24Victor MerckléVictor MerckléScore: 2,619Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 8, 2026 16:252,56129,256,98921,004,000024,576stderr
2Sep 8, 2026 16:252,57430,883,87421,112,000024,576stderr
3Sep 8, 2026 16:252,61230,619,63921,424,000024,576stderr
4Sep 8, 2026 16:252,61430,616,33721,442,000024,576stderr
5Sep 8, 2026 16:252,61930,103,63021,479,000024,576stderr
6Sep 8, 2026 16:252,62729,862,89921,543,000024,576stderr
7Sep 8, 2026 16:252,64029,955,74020,607,0001,044,00024,576stderr
8Sep 8, 2026 16:252,64330,066,82521,678,000024,576stderr
9Sep 8, 2026 16:252,64630,888,80721,705,000024,576stderr