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 14, 2024 23:43zielajzielajScore: 5,166Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 14, 2024 23:435,13063,678,29534,053,0008,012,0002,424,832
2Oct 14, 2024 23:435,16671,370,13034,290,0008,068,0002,318,336
3Oct 14, 2024 23:435,47972,641,02931,946,00012,978,0002,289,664