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 10, 2026 20:34olliecrowolliecrowScore: 11,318Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 10, 2026 20:3410,554112,661,83386,544,00002,347,008
2Mar 10, 2026 20:3411,318118,609,01287,820,0004,989,0002,383,872
3Mar 10, 2026 20:3416,461160,801,785128,981,0005,999,0002,277,376