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 listJan 9, 2025 09:26Ian MckibbenIan MckibbenScore: 84,690Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 9, 2025 09:2682,145697,077,008449,725,000223,863,0002,465,792
2Jan 9, 2025 09:2684,087719,178,750475,666,000213,849,0002,273,280
3Jan 9, 2025 09:2684,624719,871,166473,943,000219,973,0002,265,088
4Jan 9, 2025 09:2684,690719,438,473475,626,000218,828,0002,498,560
5Jan 9, 2025 09:2686,395735,029,127480,621,000227,820,0002,437,120
6Jan 9, 2025 09:2688,952752,335,299497,593,000231,810,0002,428,928