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 18, 2026 16:21olliecrowolliecrowScore: 77,945Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 18, 2026 16:2156,056486,935,943457,665,0001,998,0002,514,944
2Apr 18, 2026 16:2177,945666,266,893638,149,0001,000,0002,465,792
3Apr 18, 2026 16:2178,131667,789,564636,679,0003,997,0002,342,912