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 listJun 26, 2026 07:46Zhou180Zhou180Score: 3,541Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 26, 2026 07:473,50237,862,12627,661,0001,056,0002,117,632
2Jun 26, 2026 07:473,52138,001,33727,839,0001,038,0002,117,632
3Jun 26, 2026 07:473,53138,126,19627,891,0001,067,0002,117,632
4Jun 26, 2026 07:473,53538,138,17527,947,0001,045,0002,117,632
5Jun 26, 2026 07:473,54138,161,57127,983,0001,058,0002,117,632
6Jun 26, 2026 07:4721,210183,087,055171,915,0002,011,0002,117,632
7Jun 26, 2026 07:4721,679186,931,456175,764,0002,010,0002,117,632
8Jun 26, 2026 07:4721,731187,356,099176,185,0002,010,0002,117,632
9Jun 26, 2026 07:4721,790187,886,874176,670,0002,010,0002,117,632