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:30Adam FolwarcznyAdam FolwarcznyError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Oct 5, 2026 21:35Andrew Epstein10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 5, 2026 21:36053,506,66741,811,0001,187,00020,480No answer to stdout. Died or killed?stderr
2Jul 5, 2025 22:3016,638161,983,212122,391,00014,044,0002,502,656
3Jul 5, 2025 22:3018,083173,730,842135,257,00013,024,0002,273,280
4Jul 5, 2025 22:3018,084172,442,984132,261,00016,031,0002,314,240
5Jul 5, 2025 22:3018,576176,718,433140,301,00012,025,0002,367,488
6Jul 5, 2025 22:3018,706176,346,961142,363,00011,028,0002,269,184
7Jul 5, 2025 22:3019,431179,736,008149,316,00010,021,0002,310,144
8Jul 5, 2025 22:3019,719186,526,089143,727,00017,965,0002,269,184
9Jul 5, 2025 22:3019,840188,719,715151,708,00010,978,0002,441,216
10Jul 5, 2025 22:3023,078215,643,278172,221,00017,021,0002,498,560