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 listMar 4, 2026 00:19olliecrowolliecrowScore: 13,700Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 4, 2026 00:1913,665141,451,940110,054,0002,000,0002,502,656
2Mar 4, 2026 00:0913,673138,457,013109,119,0003,003,0002,416,640
3Mar 4, 2026 00:0913,676140,541,947109,143,0003,003,0002,494,464
4Mar 4, 2026 00:0913,677139,684,216109,148,0003,004,0002,502,656
5Mar 4, 2026 00:0913,685136,196,370110,213,0002,003,0002,310,144
6Mar 4, 2026 00:0913,700138,260,641111,336,0001,003,0002,453,504
7Mar 4, 2026 00:0913,700133,822,237111,338,0001,003,0002,301,952
8Mar 4, 2026 00:0913,701138,797,478110,343,0002,006,0002,449,408
9Mar 4, 2026 00:1913,702142,357,202109,344,0003,009,0002,424,832
10Mar 4, 2026 00:0913,714135,038,533111,449,0001,004,0002,482,176
11Mar 4, 2026 00:0913,716141,964,409111,470,0001,004,0002,494,464
12Mar 4, 2026 00:1913,911142,147,283112,071,0002,001,0002,498,560