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 13, 2024 00:17zielajzielajScore: 121,983Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 13, 2024 00:17115,390972,121,480931,208,00014,987,0002,514,944
2Oct 13, 2024 00:17116,190980,847,713934,764,00017,995,0002,326,528
3Oct 13, 2024 00:17116,574979,302,940947,911,0007,999,0002,514,944
4Oct 13, 2024 00:17120,7301,017,980,774970,984,00018,999,0002,314,240
5Oct 13, 2024 00:17121,9831,025,086,641990,271,0009,992,0002,506,752
6Oct 13, 2024 00:17122,4751,032,450,810995,302,0008,993,0002,494,464
7Oct 13, 2024 00:17126,2371,061,469,8251,023,156,00011,990,0002,326,528
8Oct 13, 2024 00:17128,7161,077,768,8581,044,479,00010,994,0002,482,176
9Oct 13, 2024 00:17129,0111,088,679,1971,046,891,00010,998,0002,330,624