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 13, 2026 16:16Dominique GarmierDominique GarmierScore: 18,814Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 13, 2026 16:1618,806176,784,335153,208,0001,001,0002,506,752
2Mar 13, 2026 16:1618,814178,324,320153,273,0001,001,0002,469,888
3Mar 13, 2026 16:1618,868182,422,111152,724,0001,996,0002,465,792