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 listOct 19, 2026 04:09zayd-ansari-codezayd-ansari-codeScore: 1,003,342Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 19, 2026 04:15999,8108,210,062,9318,043,747,000154,703,0002,113,536
2Oct 19, 2026 04:151,003,3428,239,352,0028,073,355,000154,053,0002,113,536
3Oct 19, 2026 04:151,008,2908,279,442,3968,113,052,000154,928,0002,113,536