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 26, 2026 16:54Dominique GarmierDominique GarmierScore: 216,741Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 26, 2026 16:54216,6631,807,731,8501,775,634,000999,0002,560,000
2Mar 26, 2026 19:00216,6801,805,083,1811,775,773,000999,0002,551,808
3Mar 26, 2026 19:00216,6931,804,221,1211,774,887,0001,998,0002,445,312
4Mar 26, 2026 16:54216,7411,804,594,6891,774,276,0002,998,0002,453,504
5Mar 26, 2026 19:00216,7461,809,924,7631,774,321,0002,998,0002,555,904
6Mar 26, 2026 16:54216,9211,808,915,7531,774,756,0003,997,0002,445,312