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 listJul 6, 2025 18:18Adam FolwarcznyAdam FolwarcznyScore: 18,811Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 6, 2025 18:1913,883141,035,70798,859,00014,978,0002,293,760
2Jul 6, 2025 18:1915,902154,284,552115,352,00015,045,0002,453,504
3Jul 6, 2025 18:1817,325163,990,405132,062,00010,004,0002,433,024
4Jul 6, 2025 18:1917,471169,802,536124,225,00019,034,0002,441,216
5Jul 6, 2025 18:1917,714168,548,986131,233,00014,024,0002,383,872
6Jul 6, 2025 18:1918,261173,071,085134,767,00014,974,0002,260,992
7Jul 6, 2025 18:1918,811176,017,613136,225,00018,029,0002,359,296
8Jul 6, 2025 18:1919,088183,617,093140,465,00016,053,0002,433,024
9Jul 6, 2025 18:1919,301181,494,951146,248,00012,020,0002,441,216
10Jul 6, 2025 18:1820,031191,988,035151,235,00013,020,0002,469,888
11Jul 6, 2025 18:1920,548197,247,719151,446,00017,050,0002,367,488
12Jul 6, 2025 18:1820,841195,871,671148,911,00021,986,0002,412,544