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 27, 2026 12:23Dominique GarmierDominique GarmierScore: 258,055Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 27, 2026 12:23253,4312,103,385,5582,074,135,0003,998,0002,338,816
2Mar 27, 2026 12:23258,0552,144,734,7192,107,059,0008,995,0002,314,240
3Mar 27, 2026 12:23258,8962,154,068,1182,108,955,00013,993,0002,404,352