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 listMar 26, 2026 20:59Dominique GarmierDominique GarmierScore: 209,943Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 26, 2026 20:59204,9121,710,009,3071,678,283,0001,999,0002,322,432
2Mar 26, 2026 20:59209,9431,752,789,4941,716,532,0004,998,0002,510,848
3Mar 26, 2026 20:59210,5811,757,526,7611,725,765,000999,0002,301,952