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 listOct 1, 2026 21:26C21C21Score: 3,343Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 1, 2026 21:283,32837,995,60825,215,0002,077,0002,117,632stderr
2Oct 1, 2026 21:283,33337,995,62325,278,0002,058,0002,117,632stderr
3Oct 1, 2026 21:283,33538,047,88525,263,0002,091,0002,117,632stderr
4Oct 1, 2026 21:283,34038,599,81825,321,0002,073,0002,117,632stderr
5Oct 1, 2026 21:283,34338,070,23425,370,0002,043,0002,117,632stderr
6Oct 1, 2026 21:283,35538,840,42225,315,0002,198,0002,117,632stderr
7Oct 1, 2026 21:283,35938,832,49625,299,0002,250,0002,117,632stderr
8Oct 1, 2026 21:283,38838,473,54425,494,0002,292,0002,117,632stderr
9Oct 1, 2026 21:2813,905125,313,14999,970,00014,053,0002,121,728stderr