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 23:10Dominique GarmierDominique GarmierScore: 13,508Success
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 23:1013,355134,565,256108,503,0001,004,0002,506,752
2Mar 22, 2026 23:1013,508138,832,226109,766,000997,0002,437,120
3Mar 22, 2026 23:1013,519135,741,787108,857,0001,997,0002,433,024