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 listMay 7, 2025 08:28KeefeKeefeScore: 12,012Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 7, 2025 08:2511,992119,734,62998,334,00002,428,928
2May 7, 2025 08:2511,997122,435,21997,371,0001,003,0002,420,736
3May 7, 2025 08:2512,001125,048,98397,405,0001,004,0002,469,888
4May 7, 2025 08:2512,005120,910,06698,440,00002,416,640
5May 7, 2025 08:2512,007120,016,45798,454,00002,404,352
6May 7, 2025 08:2512,009129,272,43398,477,00002,424,832
7May 7, 2025 08:2512,012130,516,58897,492,0001,005,0002,457,600
8May 7, 2025 08:2512,014124,934,14297,507,0001,005,0002,506,752
9May 7, 2025 08:2812,015123,645,90197,522,0001,005,0002,453,504
10May 7, 2025 08:2812,017128,793,10096,529,0002,011,0002,457,600
11May 7, 2025 08:2812,021122,612,01996,583,0001,991,0002,412,544
12May 7, 2025 08:2512,045127,519,61896,777,0001,995,0002,367,488