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 listMar 14, 2026 20:37Elijah KinElijah KinScore: 975,265Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 14, 2026 20:37974,9528,032,174,8947,790,772,000203,837,0002,306,048
2Mar 14, 2026 20:37975,2658,027,564,8587,795,323,000201,853,0002,408,448
3Mar 14, 2026 20:37982,7808,095,041,2357,861,944,000196,848,0002,277,376