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 14:46olliecrowolliecrowScore: 3,287Success
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 14:463,27953,367,49624,896,0001,991,0002,445,312
2Mar 20, 2026 14:463,28757,161,87324,960,0001,996,0002,486,272
3Mar 20, 2026 14:4621,421204,812,499172,640,0003,011,0002,322,432