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 3, 2026 00:39Karthik ReddyKarthik ReddyScore: 2,852Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 3, 2026 00:402,70931,235,83219,765,0002,454,00020,480
2Oct 3, 2026 00:402,71731,322,53620,462,0001,822,00020,480
3Oct 3, 2026 00:402,73831,554,82520,955,0001,501,00020,480
4Oct 3, 2026 00:402,79931,900,62420,685,0002,272,00020,480
5Oct 3, 2026 00:402,85232,374,86919,845,0003,547,00020,480
6Oct 3, 2026 00:402,85632,475,88619,834,0003,588,00020,480
7Oct 3, 2026 00:402,88532,696,25819,866,0003,798,00020,480
8Oct 3, 2026 00:402,95433,282,94119,876,0004,351,00020,480
9Oct 3, 2026 00:405,24052,076,61538,875,0004,094,00020,480