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:26Karthik ReddyKarthik ReddyScore: 3,358Success
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:282,7856,032,059,14821,825,0001,014,00020,480
2Oct 2, 2026 23:282,8696,032,753,77422,438,0001,088,00020,480
3Oct 2, 2026 23:282,9076,033,310,81322,775,0001,067,00020,480
4Oct 2, 2026 23:282,9616,033,504,01423,130,0001,151,00020,480
5Oct 2, 2026 23:283,3586,036,655,52926,459,0001,083,00020,480
6Oct 2, 2026 23:2829,3036,250,091,788239,181,0001,110,00020,480
7Oct 2, 2026 23:2829,9566,254,870,540244,509,0001,132,00020,480
8Oct 2, 2026 23:2830,6036,260,187,935249,948,0001,001,00020,480
9Oct 2, 2026 23:2830,9356,262,968,421252,658,0001,010,00020,480