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 04:21olliecrowolliecrowScore: 23,007Success
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 04:213,54659,714,85726,072,0003,008,0002,269,184
2Mar 20, 2026 04:2123,007214,261,496185,651,0003,010,0002,523,136
3Mar 20, 2026 04:2123,083206,589,573185,274,0004,005,0002,310,144