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 22, 2025 22:08Adam FolwarcznyAdam FolwarcznyScore: 65,102Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 22, 2025 22:1164,579555,285,364402,656,000126,891,0002,277,376
2Jun 22, 2025 22:1164,857556,394,065409,865,000121,959,0002,375,680
3Jun 22, 2025 22:0865,025566,144,861426,163,000107,041,0002,293,760
4Jun 22, 2025 22:0865,102565,412,227415,872,000117,963,0002,293,760
5Jun 22, 2025 22:1165,348563,348,749419,884,000115,968,0002,301,952
6Jun 22, 2025 22:0865,529566,219,384421,480,000115,857,0002,293,760