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:40spacecat8086spacecat8086Score: 112,955Success
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:4084,359726,285,676575,788,000115,957,0002,424,832
2Feb 1, 2025 17:4091,124773,683,292615,357,000131,862,0002,301,952
3Feb 1, 2025 17:4096,400814,196,626664,561,000125,916,0002,306,048
4Feb 1, 2025 17:40106,357902,423,448745,257,000126,873,0002,396,160
5Feb 1, 2025 17:40112,955959,735,596798,336,000127,893,0002,351,104
6Feb 1, 2025 17:40124,4801,047,468,261889,902,000130,838,0002,301,952
7Feb 1, 2025 17:40130,1791,098,352,082950,526,000116,941,0002,387,968
8Feb 1, 2025 17:40141,2101,188,217,4701,036,035,000121,886,0002,297,856
9Feb 1, 2025 17:40157,6011,318,943,1461,186,469,000105,863,0002,506,752