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 listNov 26, 2023 14:39mmalczakmmalczakScore: 74,379Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 26, 2023 14:3570,050632,578,346574,406,15502,179,072
2Nov 26, 2023 14:3570,497631,287,302578,077,61902,179,072
3Nov 26, 2023 14:3974,046666,951,987607,178,89602,179,072
4Nov 26, 2023 14:3974,379668,975,438609,907,65502,174,976
5Nov 26, 2023 14:3576,269692,118,688625,402,65502,301,952
6Nov 26, 2023 14:3988,243787,716,505723,594,97002,174,976