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 18, 2026 21:58Dominique GarmierDominique GarmierScore: 18,256Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 18, 2026 21:5818,252175,793,308147,673,0001,995,0002,514,944
2Mar 18, 2026 21:5818,256179,268,830148,701,000997,0002,289,664
3Mar 18, 2026 21:5818,288180,438,834147,966,0001,999,0002,289,664