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 28, 2026 11:40Dominique GarmierDominique GarmierScore: 14,647Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 28, 2026 11:4012,389126,345,30896,558,0005,029,0002,293,760
2Mar 28, 2026 11:4014,647146,649,499115,101,0005,004,0002,355,200
3Mar 28, 2026 11:4014,746145,873,778113,921,0006,995,0002,473,984