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 listApr 24, 2026 18:20olliecrowolliecrowScore: 3,414Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 24, 2026 18:203,29944,184,92025,051,0002,004,0002,543,616stderr
2Apr 24, 2026 18:203,32243,782,04726,235,0001,009,0002,502,656stderr
3Apr 24, 2026 18:203,34348,267,94327,420,00002,465,792stderr
4Apr 24, 2026 18:203,36346,328,43626,563,0001,021,0002,342,912stderr
5Apr 24, 2026 18:203,41447,991,16626,001,0002,000,0002,371,584stderr
6Apr 24, 2026 18:203,44144,328,01727,174,0001,045,0002,498,560stderr
7Apr 24, 2026 18:203,63144,756,33026,799,0002,977,0002,363,392stderr
8Apr 24, 2026 18:2023,789215,410,853192,075,0003,001,0002,564,096stderr
9Apr 24, 2026 18:2023,821211,007,837194,339,0001,001,0002,506,752stderr