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 listFeb 1, 2025 17:50spacecat8086spacecat8086Score: 106,495Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 1, 2025 17:5073,684630,422,936461,398,000142,813,0002,314,240
2Feb 1, 2025 17:5076,895653,666,938492,638,000137,898,0002,523,136
3Feb 1, 2025 17:5081,266697,991,441523,513,000142,867,0002,310,144
4Feb 1, 2025 17:5085,574735,632,244562,764,000138,941,0002,445,312
5Feb 1, 2025 17:50106,495900,123,111735,380,000137,883,0002,387,968
6Feb 1, 2025 17:50107,406907,244,970741,932,000138,800,0002,310,144
7Feb 1, 2025 17:50113,624955,315,601792,908,000138,808,0002,404,352
8Feb 1, 2025 17:50115,909982,253,761813,678,000136,777,0002,306,048
9Feb 1, 2025 17:50123,0471,033,818,232866,131,000142,856,0002,301,952