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 22, 2026 23:06Dominique GarmierDominique GarmierScore: 28,158Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 22, 2026 23:0628,096256,840,891230,386,00002,478,080
2Mar 22, 2026 23:0628,158259,110,042229,895,000999,0002,392,064
3Mar 22, 2026 23:0628,274253,774,862229,850,0001,998,0002,281,472