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 listSep 26, 2026 18:41Kevin HeaveyKevin HeaveyScore: 2,502Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 26, 2026 18:442,49529,305,33620,467,000020,480
2Sep 26, 2026 18:442,49629,312,07720,475,000020,480
3Sep 26, 2026 18:442,49729,488,98920,479,000020,480
4Sep 26, 2026 18:442,50129,223,07220,509,000020,480
5Sep 26, 2026 18:442,50229,142,05920,522,000020,480
6Sep 26, 2026 18:442,50429,123,73920,533,000020,480
7Sep 26, 2026 18:442,51429,241,40220,622,000020,480
8Sep 26, 2026 18:445,78556,140,88345,418,0002,024,00020,480
9Sep 26, 2026 18:445,82056,496,84345,702,0002,024,00020,480