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 29, 2026 00:13Dominique GarmierDominique GarmierError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Sep 4, 2026 11:37Tomislav Tunkovic10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 4, 2026 11:40093,259,10179,024,0002,047,00045,056Exit with code 2: panic: runtime error: index out of range [600000] with length 600000 goroutine 1 [running]: main.main() /src/main.go:109 +0x78bstderr
2Mar 29, 2026 00:1317,685171,868,346144,015,0001,000,0002,547,712
3Mar 29, 2026 00:1317,804174,569,104142,992,0002,999,0002,420,736
4Mar 29, 2026 00:1317,830170,266,777143,206,0003,004,0002,334,720