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 29, 2026 16:16Dominique GarmierDominique GarmierScore: 161,071Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 29, 2026 16:16159,6171,339,628,3511,308,860,00002,359,296
2Mar 29, 2026 16:16161,0711,347,323,2501,319,781,000999,0002,527,232
3Mar 29, 2026 16:16373,2483,088,091,0783,059,634,000999,0002,465,792