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 05:07olliecrowolliecrowScore: 21,973Success
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 05:073,42452,883,32125,072,0003,008,0002,433,024
2Mar 20, 2026 05:0721,973203,565,045177,179,0003,003,0002,392,064
3Mar 20, 2026 05:0722,025205,983,759177,599,0003,010,0002,465,792