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 27, 2026 16:39Dominique GarmierDominique GarmierScore: 9,545Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 27, 2026 16:399,520101,457,07675,058,0003,002,0002,326,528
2Mar 27, 2026 14:479,53099,040,68275,138,0003,005,0002,310,144
3Mar 27, 2026 14:479,54497,222,42074,248,0004,013,0002,506,752
4Mar 27, 2026 16:399,545100,582,98473,254,0005,017,0002,338,816
5Mar 27, 2026 16:399,572104,408,40677,483,0001,006,0002,482,176
6Mar 27, 2026 14:479,577103,775,19676,519,0002,013,0002,330,624