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 listApr 24, 2026 05:30olliecrowolliecrowScore: 3,412Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 24, 2026 05:313,39447,800,04224,854,0002,982,0002,375,680
2Apr 24, 2026 05:313,40748,881,43424,948,0002,993,0002,428,928
3Apr 24, 2026 05:313,41048,451,69824,969,0002,996,0002,420,736
4Apr 24, 2026 05:313,41148,700,89925,978,0001,998,0002,383,872
5Apr 24, 2026 05:313,41243,910,55124,984,0002,998,0002,433,024
6Apr 24, 2026 05:313,41342,714,46124,991,0002,998,0002,433,024
7Apr 24, 2026 05:313,43345,564,45725,139,0003,016,0002,469,888
8Apr 24, 2026 05:3123,404208,283,790185,920,0005,997,0002,461,696
9Apr 24, 2026 05:3123,478209,710,207187,535,0004,987,0002,363,392