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 00:13Dominique GarmierDominique GarmierScore: 17,804Success
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 00:1317,685171,868,346144,015,0001,000,0002,547,712
2Mar 29, 2026 00:1317,804174,569,104142,992,0002,999,0002,420,736
3Mar 29, 2026 00:1317,830170,266,777143,206,0003,004,0002,334,720