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 28, 2025 06:52KeefeKeefeScore: 35,756Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 28, 2025 06:5234,953316,653,201284,618,0001,997,0002,277,376
2Apr 28, 2025 06:5235,101312,229,130284,828,0002,998,0002,269,184
3Apr 28, 2025 06:5235,423319,620,231288,475,0001,996,0002,265,088
4Apr 28, 2025 06:5235,455317,561,373287,733,0002,997,0002,277,376
5Apr 28, 2025 06:5235,756320,245,802292,198,0001,000,0002,269,184
6Apr 28, 2025 06:5235,814313,979,934291,674,0001,997,0002,269,184
7Apr 28, 2025 06:5235,835318,279,618291,851,0001,998,0002,277,376
8Apr 28, 2025 06:5236,262322,277,779297,352,00002,523,136
9Apr 28, 2025 06:5236,297319,930,042294,639,0002,996,0002,269,184