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 21, 2026 12:35Dominique GarmierDominique GarmierScore: 14,251Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 21, 2026 12:3514,239144,041,117114,767,0001,995,0002,367,488
2Mar 21, 2026 12:3514,251140,582,096114,862,0001,997,0002,301,952
3Mar 21, 2026 12:3514,254144,715,358115,885,000999,0002,363,392