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 23:24Dominique GarmierDominique GarmierScore: 13,656Success
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 23:2413,413141,127,309108,987,000999,0002,359,296
2Mar 23, 2026 23:2413,656141,529,174108,981,0002,999,0002,265,088
3Mar 23, 2026 23:2413,768141,295,121110,899,0001,998,0002,273,280