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 4, 2026 00:20Josu San MartinJosu San MartinScore: 3,051Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 4, 2026 00:213,03834,834,10423,713,0001,203,0002,117,632stderr
2Sep 4, 2026 00:213,04434,888,66323,921,0001,042,0002,117,632stderr
3Sep 4, 2026 00:213,04834,986,51023,876,0001,119,0002,117,632stderr
4Sep 4, 2026 00:213,05034,868,53323,803,0001,208,0002,117,632stderr
5Sep 4, 2026 00:213,05134,873,62523,820,0001,204,0002,117,632stderr
6Sep 4, 2026 00:213,05334,899,50323,827,0001,210,0002,117,632stderr
7Sep 4, 2026 00:213,08135,128,69724,057,0001,208,0002,117,632stderr
8Sep 4, 2026 00:2116,447144,776,818133,862,0001,006,0002,117,632stderr
9Sep 4, 2026 00:2116,485145,109,352134,176,0001,004,0002,117,632stderr