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 listOct 2, 2026 23:30Karthik ReddyKarthik ReddyScore: 3,011Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 2, 2026 23:322,8766,032,843,85522,511,0001,079,00020,480
2Oct 2, 2026 23:322,8846,033,013,26822,552,0001,099,00020,480
3Oct 2, 2026 23:322,9066,033,098,32422,775,0001,061,00020,480
4Oct 2, 2026 23:322,9716,033,569,33823,346,0001,017,00020,480
5Oct 2, 2026 23:323,0116,033,885,70823,551,0001,147,00020,480
6Oct 2, 2026 23:325,2526,052,322,89342,024,0001,047,00020,480
7Oct 2, 2026 23:325,2756,052,561,68242,234,0001,028,00020,480
8Oct 2, 2026 23:325,3106,052,824,58642,475,0001,069,00020,480
9Oct 2, 2026 23:325,3686,053,382,12142,900,0001,123,00020,480