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 21, 2026 04:35Yuriy LyfenkoYuriy LyfenkoScore: 4,122Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 21, 2026 04:384,071554,643,77931,358,0002,023,0002,445,312
2Mar 21, 2026 04:384,079554,370,73232,434,0001,013,0002,482,176
3Mar 21, 2026 04:384,098562,424,59930,550,0003,055,0002,412,544
4Mar 21, 2026 04:354,122563,132,65130,819,0002,982,0002,412,544
5Mar 21, 2026 04:354,124557,789,23729,839,0003,978,0002,420,736
6Mar 21, 2026 04:354,143563,149,79430,974,0002,997,0002,482,176