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 4, 2026 07:12Josu San MartinJosu San MartinScore: 3,075Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 4, 2026 07:173,03735,768,93423,887,0001,023,0002,121,728stderr
2Sep 4, 2026 07:173,06535,024,04124,113,0001,028,0002,121,728stderr
3Sep 4, 2026 07:173,06535,125,36824,087,0001,050,0002,121,728stderr
4Sep 4, 2026 07:173,07336,039,92324,175,0001,031,0002,121,728stderr
5Sep 4, 2026 07:173,07535,136,75824,189,0001,028,0002,121,728stderr
6Sep 4, 2026 07:173,09136,036,36224,295,0001,053,0002,121,728stderr
7Sep 4, 2026 07:173,09136,091,10224,307,0001,040,0002,121,728stderr
8Sep 4, 2026 07:173,09836,014,70324,385,0001,025,0002,121,728stderr
9Sep 4, 2026 07:1715,252135,032,336124,026,0001,041,0002,121,728stderr