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:36Adam FolwarcznyAdam FolwarcznyScore: 973,900Success
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:36958,9367,909,995,7347,661,452,000201,827,0002,277,376
2Jun 19, 2025 21:36969,6907,982,951,5467,756,617,000194,839,0002,277,376
3Jun 19, 2025 21:36972,7818,009,934,4777,780,958,000195,847,0002,277,376
4Jun 19, 2025 21:36973,1908,014,703,8257,778,332,000201,826,0002,277,376
5Jun 19, 2025 21:36973,9008,015,860,9397,792,150,000193,829,0002,269,184
6Jun 19, 2025 21:36973,9938,020,653,4657,790,895,000195,846,0002,277,376
7Jun 19, 2025 21:36974,6088,023,011,7697,795,962,000195,823,0002,289,664
8Jun 19, 2025 21:36974,8798,027,365,3027,798,179,000195,828,0002,519,040
9Jun 19, 2025 21:36979,9908,069,069,1517,848,060,000187,857,0002,510,848