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 11, 2026 02:43Sergey SerebryakovSergey SerebryakovScore: 13,458Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 11, 2026 02:4313,371139,057,566108,647,000996,0002,514,944
2Mar 11, 2026 02:4313,377141,575,557108,695,000997,0002,506,752
3Mar 11, 2026 02:4313,389139,550,987107,795,0001,996,0002,334,720
4Mar 11, 2026 02:4313,453134,054,067108,313,0002,005,0002,416,640
5Mar 11, 2026 02:4313,458135,311,079108,351,0002,006,0002,285,568
6Mar 11, 2026 02:4313,473135,094,506108,474,0002,008,0002,482,176
7Mar 11, 2026 02:4313,601141,090,564111,531,00002,412,544
8Mar 11, 2026 02:4313,813139,651,965111,260,0002,004,0002,416,640
9Mar 11, 2026 02:4314,410143,315,685114,159,0004,005,0002,412,544