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 listMay 20, 2026 19:07M-RochatM-RochatScore: 9,893Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 20, 2026 19:089,60088,060,40674,662,0004,065,0002,113,536
2May 20, 2026 19:089,61989,980,72174,757,0004,120,0002,113,536
3May 20, 2026 19:089,80492,797,58876,366,0004,028,0002,113,536
4May 20, 2026 19:089,86593,148,83376,854,0004,046,0002,113,536
5May 20, 2026 19:089,89391,079,45877,040,0004,088,0002,113,536
6May 20, 2026 19:089,94793,709,26077,483,0004,083,0002,113,536
7May 20, 2026 19:0821,762190,750,705173,777,0004,672,0002,117,632
8May 20, 2026 19:0821,869189,906,451175,309,0004,022,0002,117,632
9May 20, 2026 19:0821,968189,589,009176,121,0004,023,0002,117,632