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 listFeb 26, 2025 05:46Eugene ZhydzetskiEugene ZhydzetskiScore: 21,416Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 26, 2025 05:4620,532194,775,850167,359,0001,002,0002,314,240
2Feb 26, 2025 05:4620,997196,324,574170,170,0002,002,0002,494,464
3Feb 26, 2025 05:4621,192196,392,935170,779,0002,996,0002,326,528
4Feb 26, 2025 05:4621,216205,117,555170,969,0002,999,0002,322,432
5Feb 26, 2025 05:4621,416203,988,345174,609,0001,003,0002,322,432
6Feb 26, 2025 05:4621,658206,712,299176,590,0001,003,0002,322,432
7Feb 26, 2025 05:4621,682204,220,155175,798,0001,997,0002,322,432
8Feb 26, 2025 05:4622,046213,690,790180,778,00002,322,432
9Feb 26, 2025 05:4622,292208,412,635178,798,0003,995,0002,314,240