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 20, 2026 02:31Dominique GarmierDominique GarmierScore: 13,108Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 20, 2026 02:3113,070133,619,922105,172,0002,003,0002,273,280
2Mar 20, 2026 02:3113,108135,674,902105,475,0002,009,0002,260,992
3Mar 20, 2026 02:3113,145134,293,877104,793,0002,994,0002,289,664