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 20, 2026 03:59olliecrowolliecrowScore: 3,534Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 20, 2026 03:593,51859,255,49927,853,000994,0002,379,776
2Mar 20, 2026 03:593,53452,408,85726,982,0001,998,0002,428,928
3Mar 20, 2026 03:593,56356,396,40328,213,0001,007,0002,445,312