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 listApr 25, 2026 07:00limanjun99limanjun99Score: 46,207Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 25, 2026 07:0146,076396,671,120370,835,0006,996,0002,535,424stderr
2Apr 25, 2026 07:0146,207401,044,694372,900,0005,998,0002,400,256stderr
3Apr 25, 2026 07:0148,285413,790,981380,946,00014,997,0002,322,432stderr