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 11:55Victor MerckléVictor MerckléScore: 2,645Success
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 11:562,56229,259,19121,014,000024,576stderr
2Sep 8, 2026 11:562,58529,706,02121,201,000024,576stderr
3Sep 8, 2026 11:562,64030,057,62921,650,000024,576stderr
4Sep 8, 2026 11:562,64330,839,85121,675,000024,576stderr
5Sep 8, 2026 11:562,64529,984,61521,689,000024,576stderr
6Sep 8, 2026 11:562,64630,079,45321,702,000024,576stderr
7Sep 8, 2026 11:562,65930,926,53521,804,000024,576stderr
8Sep 8, 2026 11:565,40752,757,95243,328,0001,015,00024,576stderr
9Sep 8, 2026 11:565,52753,512,75844,315,0001,014,00024,576stderr