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 26, 2026 19:35NicoNicoScore: 6,212Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 26, 2026 19:366,15261,300,17946,161,0004,293,0002,117,632
2Oct 26, 2026 19:366,16161,349,66846,260,0004,266,0002,117,632
3Oct 26, 2026 19:366,20163,464,86546,694,0004,161,0002,117,632
4Oct 26, 2026 19:366,20461,795,22546,456,0004,418,0002,117,632
5Oct 26, 2026 19:366,21261,864,64746,392,0004,551,0002,117,632
6Oct 26, 2026 19:366,21461,799,80946,731,0004,228,0002,117,632
7Oct 26, 2026 19:366,24562,026,28346,624,0004,589,0002,117,632
8Oct 26, 2026 19:366,31362,668,40447,232,0004,538,0002,117,632
9Oct 26, 2026 19:366,34162,866,31547,388,0004,614,0002,117,632