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:33zielajzielajScore: 125,753Success
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:33120,6581,017,244,280967,409,00021,986,0002,371,584
2Oct 13, 2024 00:33125,7531,053,764,2961,011,188,00019,983,0002,519,040
3Oct 13, 2024 00:33133,2501,114,040,4831,060,660,00031,989,0002,359,296