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 10:18Dominique GarmierDominique GarmierScore: 482,344Success
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 10:18472,36216,276,619,689666,472,0003,206,896,000356,352
2Mar 21, 2026 10:18482,34416,841,708,415653,603,0003,301,616,000294,912
3Mar 21, 2026 10:18502,79618,688,213,550719,563,0003,403,367,000335,872