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 listJan 29, 2025 22:47KeefeKeefeScore: 108,209Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 29, 2025 22:47103,730880,182,281720,652,000129,937,0002,281,472
2Jan 29, 2025 22:47104,677879,169,094728,448,000129,901,0002,318,336
3Jan 29, 2025 22:47107,720911,803,531759,404,000123,902,0002,281,472
4Jan 29, 2025 22:47107,746906,157,954751,588,000131,927,0002,269,184
5Jan 29, 2025 22:47108,209910,503,935770,406,000116,909,0002,301,952
6Jan 29, 2025 22:47108,227911,883,395755,543,000131,920,0002,310,144
7Jan 29, 2025 22:47108,554914,148,308764,266,000125,879,0002,306,048
8Jan 29, 2025 22:47109,854926,947,501780,960,000119,840,0002,281,472
9Jan 29, 2025 22:47110,826937,944,522788,936,000119,838,0002,490,368