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 22:17Josu San MartinJosu San MartinScore: 3,248Success
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 22:183,22236,420,33925,377,0001,044,0002,121,728stderr
2Sep 3, 2026 22:183,22436,388,21925,405,0001,037,0002,121,728stderr
3Sep 3, 2026 22:183,22936,560,02925,458,0001,020,0002,121,728stderr
4Sep 3, 2026 22:183,23136,500,27825,450,0001,050,0002,121,728stderr
5Sep 3, 2026 22:183,24836,782,46025,605,0001,031,0002,121,728stderr
6Sep 3, 2026 22:183,24936,695,90325,621,0001,025,0002,121,728stderr
7Sep 3, 2026 22:183,24936,555,03525,615,0001,027,0002,121,728stderr
8Sep 3, 2026 22:183,25536,596,86925,671,0001,022,0002,121,728stderr
9Sep 3, 2026 22:1815,656138,344,902127,358,0001,025,0002,121,728stderr