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 06:00olliecrowolliecrowScore: 12,072Success
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 06:0012,053128,425,38696,838,0001,996,0002,465,792
2Mar 10, 2026 06:0012,072136,783,57397,989,000999,0002,424,832
3Mar 10, 2026 06:0012,147127,514,41799,607,00002,465,792