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 24, 2026 09:00Kevin HeaveyKevin HeaveyScore: 5,726Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 24, 2026 09:062,50129,189,70120,513,000020,480
2Sep 24, 2026 09:062,50129,898,09720,509,000020,480
3Sep 24, 2026 09:062,51330,014,77220,612,000020,480
4Sep 24, 2026 09:062,89832,390,69619,729,0004,038,00020,480
5Sep 24, 2026 09:065,72656,299,08644,930,0002,027,00020,480
6Sep 24, 2026 09:065,77156,026,88745,306,0002,022,00020,480
7Sep 24, 2026 09:065,86656,719,87046,085,0002,020,00020,480
8Sep 24, 2026 09:066,16559,117,90545,684,0004,877,00020,480
9Sep 24, 2026 09:066,22359,640,73745,425,0005,611,00020,480