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 listMay 11, 2026 22:56Victor MerckléVictor MerckléScore: 12,748Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 11, 2026 22:573,37138,982,00126,587,0001,058,0002,113,536
2May 11, 2026 22:573,38738,814,67626,712,0001,062,0002,113,536
3May 11, 2026 22:573,39539,148,75426,777,0001,070,0002,113,536
4May 11, 2026 22:573,40139,241,52326,848,0001,045,0002,113,536
5May 11, 2026 22:5712,748115,112,454102,391,0002,143,0002,113,536
6May 11, 2026 22:5712,788114,669,397102,848,0002,014,0002,113,536
7May 11, 2026 22:5713,380120,821,350107,534,0002,187,0002,113,536
8May 11, 2026 22:5713,509121,676,352108,511,0002,263,0002,113,536
9May 11, 2026 22:5713,517120,102,354108,828,0002,015,0002,113,536