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 23, 2026 19:44Dominique GarmierDominique GarmierScore: 12,576Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 23, 2026 19:4412,543132,988,085100,858,0001,997,0002,342,912
2Mar 23, 2026 19:4412,576131,387,991101,123,0002,002,0002,400,256
3Mar 23, 2026 19:4412,583136,893,340102,176,0001,001,0002,359,296