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 listAug 14, 2026 18:21marko1597marko1597Score: 3,841Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 14, 2026 18:243,78939,351,41430,044,0001,031,0002,121,728stderr
2Aug 14, 2026 18:243,79740,918,82930,114,0001,028,0002,121,728stderr
3Aug 14, 2026 18:243,80039,438,55730,123,0001,044,0002,121,728stderr
4Aug 14, 2026 18:243,82739,806,56230,342,0001,040,0002,121,728stderr
5Aug 14, 2026 18:243,84140,566,64530,452,0001,047,0002,121,728stderr
6Aug 14, 2026 18:243,84939,779,80230,539,0001,027,0002,121,728stderr
7Aug 14, 2026 18:243,85640,747,36130,587,0001,037,0002,121,728stderr
8Aug 14, 2026 18:243,87740,147,45030,770,0001,028,0002,121,728stderr
9Aug 14, 2026 18:243,89940,307,47230,939,0001,039,0002,121,728stderr