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 listJul 5, 2025 22:22Adam FolwarcznyAdam FolwarcznyScore: 20,540Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 5, 2025 22:2215,935158,140,204116,705,00013,964,0002,359,296
2Jul 5, 2025 22:2217,010167,037,977128,447,00011,038,0002,301,952
3Jul 5, 2025 22:2219,003178,612,349145,834,0009,988,0002,502,656
4Jul 5, 2025 22:2219,060179,298,368138,258,00018,033,0002,514,944
5Jul 5, 2025 22:2220,540198,165,698152,386,00016,040,0002,445,312
6Jul 5, 2025 22:2221,383198,592,031159,310,00016,031,0002,326,528
7Jul 5, 2025 22:2221,730200,488,187164,174,00014,014,0002,408,448
8Jul 5, 2025 22:2221,996201,063,893165,336,00015,030,0002,359,296
9Jul 5, 2025 22:2223,402219,913,022167,910,00023,987,0002,428,928