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 15, 2026 00:37zielajzielajError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 15, 2026 00:38038,454,63630,126,0001,033,00020,480No answer to stdout. Died or killed?stderr
2May 15, 2026 00:382,68430,802,34820,857,0001,159,0002,117,632stderr
3May 15, 2026 00:382,69430,941,71620,881,0001,217,0002,117,632stderr
4May 15, 2026 00:382,69729,441,87720,878,0001,243,0002,117,632stderr
5May 15, 2026 00:382,70029,536,36720,917,0001,226,0002,117,632stderr
6May 15, 2026 00:385,13149,812,24441,054,0001,022,0002,117,632stderr
7May 15, 2026 00:385,15449,594,71741,225,0001,038,0002,121,728stderr