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 listJun 8, 2025 17:28thatmagicalcatthatmagicalcatScore: 974,283Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 8, 2025 17:28970,8407,992,971,8237,775,055,000185,834,0002,277,376
2Jun 8, 2025 17:28972,0148,004,302,9377,779,696,000190,820,0002,473,984
3Jun 8, 2025 17:28972,1788,009,352,1987,764,050,000207,813,0002,277,376
4Jun 8, 2025 17:28973,0358,009,604,5787,787,060,000191,829,0002,502,656
5Jun 8, 2025 17:28974,2838,028,342,5867,799,285,000189,836,0002,277,376
6Jun 8, 2025 17:28974,7878,023,492,7147,786,428,000206,825,0002,277,376
7Jun 8, 2025 17:28975,9508,037,812,1357,813,940,000188,853,0002,277,376
8Jun 8, 2025 17:28976,2708,033,984,1347,812,574,000192,841,0002,277,376
9Jun 8, 2025 17:28978,9058,058,872,9207,826,198,000200,825,0002,277,376