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 listSep 3, 2026 05:49Josu San MartinJosu San MartinScore: 3,494Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 3, 2026 05:503,47538,481,80926,431,0002,068,0002,117,632
2Sep 3, 2026 05:503,47538,458,82626,406,0002,091,0002,117,632
3Sep 3, 2026 05:503,49138,581,43626,538,0002,095,0002,117,632
4Sep 3, 2026 05:503,49238,564,89226,568,0002,071,0002,117,632
5Sep 3, 2026 05:503,49439,360,74926,626,0002,032,0002,117,632
6Sep 3, 2026 05:503,49538,670,38126,641,0002,024,0002,117,632
7Sep 3, 2026 05:503,49738,714,54526,533,0002,143,0002,117,632
8Sep 3, 2026 05:5011,518105,159,68592,367,0002,088,0002,117,632
9Sep 3, 2026 05:5011,547104,641,97792,604,0002,085,0002,117,632