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:39limanjun99limanjun99Score: 5,555Success
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:405,48663,713,34440,989,0003,998,0002,535,424
2Apr 25, 2026 07:405,55560,082,07343,529,0002,024,0002,334,720
3Apr 25, 2026 07:405,60968,452,38142,996,0002,999,0002,314,240