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 26, 2026 21:27Dominique GarmierDominique GarmierScore: 10,019Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 26, 2026 21:279,983104,682,00579,863,0001,996,0002,400,256
2Mar 26, 2026 21:2710,019108,675,30180,151,0002,003,0002,445,312
3Mar 26, 2026 21:2710,045107,294,89482,373,00002,428,928