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 31, 2025 20:15DmitryDmitryScore: 972,350Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 31, 2025 20:15968,7637,976,726,2967,743,037,000200,819,0002,277,376
2Oct 31, 2025 20:15968,8287,971,603,9177,759,541,000184,846,0002,326,528
3Oct 31, 2025 20:15971,1968,000,792,0987,762,988,000200,818,0002,277,376
4Oct 31, 2025 20:15972,1017,998,074,5617,771,401,000199,830,0002,277,376
5Oct 31, 2025 20:15972,3508,011,678,9437,777,460,000195,810,0002,461,696
6Oct 31, 2025 20:15972,7088,009,619,7827,781,374,000194,834,0002,277,376
7Oct 31, 2025 20:15972,9808,009,388,8107,777,601,000200,834,0002,277,376
8Oct 31, 2025 20:15973,4708,025,460,5767,790,635,000191,818,0002,277,376
9Oct 31, 2025 20:15977,2488,048,743,4797,817,591,000195,839,0002,277,376