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 24, 2026 23:18Dominique GarmierDominique GarmierScore: 10,583Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 24, 2026 23:1810,555121,823,22086,555,00002,433,024
2Mar 24, 2026 23:1810,583112,546,12684,783,0001,994,0002,445,312
3Mar 24, 2026 23:1810,602121,381,71884,940,0001,998,0002,519,040