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 listMar 10, 2026 21:00olliecrowolliecrowScore: 10,220Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 10, 2026 21:0010,022105,042,05480,173,0002,004,0002,412,544
2Mar 10, 2026 21:0010,067116,647,65582,549,00002,490,368
3Mar 10, 2026 21:0010,139112,592,21981,133,0002,003,0002,428,928
4Mar 10, 2026 21:0010,168110,942,66882,373,0001,004,0002,387,968
5Mar 10, 2026 21:0010,220113,002,66481,809,0001,995,0002,494,464
6Mar 10, 2026 21:0010,233105,905,50881,914,0001,997,0002,396,160
7Mar 10, 2026 21:0010,247110,800,44483,025,0001,000,0002,482,176
8Mar 10, 2026 21:0010,282109,039,20282,304,0002,007,0002,453,504
9Mar 10, 2026 21:0015,284147,239,406121,321,0004,010,0002,420,736