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 21:50zielajzielajScore: 381,044Success
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 21:50372,5243,083,736,9643,044,719,0009,979,0002,535,424
2Oct 13, 2024 21:50381,0443,164,268,6603,112,585,00011,975,0002,445,312
3Oct 13, 2024 21:50388,3843,219,878,7183,171,775,00012,970,0002,416,640