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 20, 2026 04:11olliecrowolliecrowScore: 23,075Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 20, 2026 04:113,55752,373,87127,156,0002,011,0002,510,848
2Mar 20, 2026 04:1123,075214,766,020186,208,0003,003,0002,301,952
3Mar 20, 2026 04:1123,093220,014,049186,360,0003,005,0002,392,064