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 12:41Dominique GarmierDominique GarmierScore: 13,543Success
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 12:4113,508136,337,837107,775,0002,993,0002,404,352
2Mar 22, 2026 12:4113,543139,500,130109,055,0002,001,0002,461,696
3Mar 22, 2026 12:4113,550134,101,112108,109,0003,003,0002,371,584