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 10, 2026 21:20olliecrowolliecrowScore: 10,051Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 10, 2026 21:209,934103,533,03479,444,0002,011,0002,347,008
2Mar 10, 2026 21:2010,051109,445,00280,411,0002,010,0002,437,120
3Mar 10, 2026 21:2010,224111,651,54080,839,0002,994,0002,478,080