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 listOct 12, 2024 22:28zielajzielajScore: 941,549Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 12, 2024 22:28937,9947,720,831,3647,552,669,000138,883,0002,306,048
2Oct 12, 2024 22:28939,5337,743,008,1257,571,274,000132,899,0002,306,048
3Oct 12, 2024 22:28940,4267,754,975,4017,565,601,000145,895,0002,301,952
4Oct 12, 2024 22:28940,7787,745,316,8637,587,486,000126,891,0002,306,048
5Oct 12, 2024 22:28941,5497,752,381,4517,585,814,000134,890,0002,281,472
6Oct 12, 2024 22:28943,9827,773,931,7257,592,791,000147,859,0002,314,240
7Oct 12, 2024 22:28944,0447,776,992,9547,607,276,000133,881,0002,281,472
8Oct 12, 2024 22:28945,2587,782,939,5887,609,239,000141,873,0002,281,472
9Oct 12, 2024 22:28948,2127,806,663,9357,632,459,000142,877,0002,281,472