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 19, 2025 21:40Adam FolwarcznyAdam FolwarcznyScore: 104,498Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 19, 2025 21:4093,836794,189,842570,597,000198,859,0002,387,968
2Jun 19, 2025 21:4094,760804,356,856594,258,000182,772,0002,293,760
3Jun 19, 2025 21:4095,187803,955,891587,649,000192,884,0002,494,464
4Jun 19, 2025 21:40100,542850,130,865635,573,000188,873,0002,301,952
5Jun 19, 2025 21:40104,498885,524,412662,909,000193,973,0002,293,760
6Jun 19, 2025 21:40109,753928,257,270698,203,000201,769,0002,306,048
7Jun 19, 2025 21:40113,496956,658,730736,740,000193,931,0002,297,856
8Jun 19, 2025 21:40114,265963,534,186740,186,000196,783,0002,297,856
9Jun 19, 2025 21:40118,9411,002,150,872777,457,000197,861,0002,306,048