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 1, 2026 04:18Victor MerckléVictor MerckléScore: 5,414Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 1, 2026 04:192,72630,745,29421,251,0001,109,0002,117,632stderr
2Sep 1, 2026 04:195,40052,684,67843,176,0001,112,0002,117,632stderr
3Sep 1, 2026 04:195,40752,672,62843,194,0001,144,0002,117,632stderr
4Sep 1, 2026 04:195,41052,692,40643,304,0001,062,0002,117,632stderr
5Sep 1, 2026 04:195,41452,785,93643,267,0001,134,0002,117,632stderr
6Sep 1, 2026 04:195,42252,804,73843,404,0001,061,0002,117,632stderr
7Sep 1, 2026 04:195,42952,916,47743,376,0001,143,0002,117,632stderr
8Sep 1, 2026 04:195,43853,043,06743,461,0001,138,0002,117,632stderr
9Sep 1, 2026 04:195,71555,282,44745,846,0001,020,0002,117,632stderr