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 08:20Valentin KofmanValentin KofmanScore: 84,301Success
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 08:2068,463584,698,243426,544,000134,856,0002,478,080
2Jul 6, 2025 08:2074,266634,155,031469,985,000138,995,0002,433,024
3Jul 6, 2025 08:2077,969665,078,974504,485,000134,862,0002,441,216
4Jul 6, 2025 08:2082,645702,362,789537,755,000139,936,0002,416,640
5Jul 6, 2025 08:2084,301715,932,992555,413,000135,856,0002,494,464
6Jul 6, 2025 08:2085,606727,098,580564,172,000137,797,0002,363,392
7Jul 6, 2025 08:2086,203742,681,033569,888,000136,973,0002,433,024
8Jul 6, 2025 08:2086,936747,575,952575,903,000136,976,0002,428,928
9Jul 6, 2025 08:2094,869802,246,830644,108,000133,814,0002,293,760