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 26, 2026 23:11Dominique GarmierDominique GarmierScore: 136,921Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 26, 2026 23:11136,7331,148,111,3881,119,216,0001,998,0002,473,984
2Mar 26, 2026 23:11136,9211,146,028,3401,121,756,000999,0002,482,176
3Mar 26, 2026 23:11136,9901,147,288,0861,121,321,0001,998,0002,449,408