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 22, 2026 12:13Dominique GarmierDominique GarmierScore: 54,111Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 22, 2026 12:1336,945328,389,328301,946,000999,0002,379,776
2Mar 22, 2026 12:1354,111471,133,272439,714,0003,997,0002,277,376
3Mar 22, 2026 12:1354,174471,596,044439,227,0005,002,0002,334,720