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 23:02Josu San MartinJosu San MartinScore: 15,486Success
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 23:0315,423136,465,164125,464,0001,006,0002,121,728stderr
2Sep 3, 2026 23:0315,436136,581,150125,567,0001,016,0002,121,728stderr
3Sep 3, 2026 23:0315,458136,729,315125,751,0001,005,0002,121,728stderr
4Sep 3, 2026 23:0315,465136,806,141125,809,0001,008,0002,121,728stderr
5Sep 3, 2026 23:0315,486137,492,261125,964,0001,023,0002,121,728stderr
6Sep 3, 2026 23:0315,488137,047,763125,998,0001,010,0002,121,728stderr
7Sep 3, 2026 23:0315,517137,214,700126,212,0001,031,0002,121,728stderr
8Sep 3, 2026 23:0315,641138,246,533127,249,0001,014,0002,121,728stderr
9Sep 3, 2026 23:0315,672138,567,258127,506,0001,010,0002,121,728stderr