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 listSep 3, 2026 21:47Josu San MartinJosu San MartinScore: 3,230Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 3, 2026 21:483,21636,256,40625,322,0001,050,0002,121,728stderr
2Sep 3, 2026 21:483,21636,261,75925,348,0001,024,0002,121,728stderr
3Sep 3, 2026 21:483,21737,083,59225,356,0001,026,0002,121,728stderr
4Sep 3, 2026 21:483,22536,425,60225,420,0001,027,0002,121,728stderr
5Sep 3, 2026 21:483,23036,479,28025,469,0001,020,0002,121,728stderr
6Sep 3, 2026 21:483,23536,466,02425,505,0001,025,0002,121,728stderr
7Sep 3, 2026 21:483,23536,559,90725,485,0001,042,0002,121,728stderr
8Sep 3, 2026 21:483,24636,487,93825,601,0001,023,0002,121,728stderr
9Sep 3, 2026 21:4815,421136,427,426125,313,0001,142,0002,121,728stderr