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:03Josu San MartinJosu San MartinScore: 15,412Success
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:043,25336,575,86825,634,0001,046,0002,121,728stderr
2Sep 3, 2026 22:043,27736,806,18825,847,0001,025,0002,121,728stderr
3Sep 3, 2026 22:043,29036,902,75125,955,0001,028,0002,121,728stderr
4Sep 3, 2026 22:043,38337,848,33026,714,0001,030,0002,121,728stderr
5Sep 3, 2026 22:0415,412136,350,517125,376,0001,007,0002,121,728stderr
6Sep 3, 2026 22:0415,420136,434,192125,432,0001,019,0002,121,728stderr
7Sep 3, 2026 22:0415,449136,778,915125,682,0001,005,0002,121,728stderr
8Sep 3, 2026 22:0415,452138,310,667125,702,0001,007,0002,121,728stderr
9Sep 3, 2026 22:0415,464136,818,890125,797,0001,008,0002,121,728stderr