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 30, 2026 00:14Dominique GarmierDominique GarmierScore: 13,274Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 30, 2026 00:1413,245132,491,562108,610,00002,310,144
2Mar 30, 2026 00:1413,274139,147,534106,849,0001,997,0002,371,584
3Mar 30, 2026 00:1413,316136,312,363106,189,0003,005,0002,433,024