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 listJul 7, 2025 09:14Valentin KofmanValentin KofmanScore: 14,604Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 7, 2025 09:1414,549142,078,363119,304,00002,269,184
2Jul 7, 2025 09:1414,591145,857,439118,651,000997,0002,396,160
3Jul 7, 2025 09:1414,591151,284,605118,652,000997,0002,269,184
4Jul 7, 2025 09:1414,600143,790,004118,723,000997,0002,269,184
5Jul 7, 2025 09:1414,604143,029,245118,758,000997,0002,506,752
6Jul 7, 2025 09:1414,605147,047,533118,761,000997,0002,396,160
7Jul 7, 2025 09:1414,609142,827,355118,793,000998,0002,269,184
8Jul 7, 2025 09:1414,615141,678,699117,843,0001,997,0002,396,160
9Jul 7, 2025 09:1414,639143,120,596118,039,0002,000,0002,269,184