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 24, 2026 23:56Dominique GarmierDominique GarmierScore: 99,793Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 24, 2026 23:5697,387825,140,674663,643,000134,927,0002,416,640
2Mar 24, 2026 23:5699,793841,793,990679,419,000138,881,0002,433,024
3Mar 24, 2026 23:56110,148926,570,544766,334,000136,881,0002,400,256