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 20:41Victor MerckléVictor MerckléScore: 2,749Success
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 20:432,54829,370,08820,896,000024,576stderr
2Sep 8, 2026 20:432,55329,447,20420,941,000024,576stderr
3Sep 8, 2026 20:432,62329,780,45621,514,000024,576stderr
4Sep 8, 2026 20:432,63030,043,62821,574,000024,576stderr
5Sep 8, 2026 20:432,74938,498,34722,542,000024,576stderr
6Sep 8, 2026 20:435,46853,959,40443,821,0001,017,00024,576stderr
7Sep 8, 2026 20:4311,05199,733,50789,612,0001,008,00024,576stderr
8Sep 8, 2026 20:4311,06499,183,16689,720,0001,010,00024,576stderr
9Sep 8, 2026 20:4311,633103,904,10394,383,0001,010,00024,576stderr