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 listApr 20, 2026 16:18BenBenScore: 33,405Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 20, 2026 16:1933,030296,691,180100,945,000169,908,0002,433,024
2Apr 20, 2026 16:1933,405299,469,916100,973,000172,955,0002,428,928
3Apr 20, 2026 16:1933,704308,857,521102,139,000174,237,0002,445,312