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 25, 2026 05:16Dominique GarmierDominique GarmierScore: 13,824Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 25, 2026 05:1613,771136,210,244110,924,0001,998,0002,433,024
2Mar 25, 2026 05:1613,824136,400,582112,355,0001,003,0002,289,664
3Mar 25, 2026 05:1613,889137,063,335110,894,0002,997,0002,281,472