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 21, 2026 14:46e1011e1011Score: 426,789Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 21, 2026 14:46283,6053,420,408,6161,560,752,000764,811,0002,113,536
2Oct 21, 2026 14:46426,7896,115,025,0431,981,644,0001,518,028,0002,134,016
3Oct 21, 2026 14:46552,0388,169,005,7712,299,922,0002,226,794,0002,117,632