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 12, 2026 07:58Haha ExpertHaha ExpertScore: 32,068Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 12, 2026 07:5931,650268,391,634124,205,000135,333,0002,117,632
2Sep 12, 2026 07:5931,962271,425,009124,845,000137,249,0002,117,632
3Sep 12, 2026 07:5931,976270,797,183125,485,000136,722,0002,117,632
4Sep 12, 2026 07:5932,017271,571,170124,693,000137,848,0002,117,632
5Sep 12, 2026 07:5932,068271,861,493125,323,000137,635,0002,117,632
6Sep 12, 2026 07:5932,096272,757,669125,409,000137,783,0002,117,632
7Sep 12, 2026 07:5932,118271,950,575125,011,000138,364,0002,117,632
8Sep 12, 2026 07:5932,220273,726,631129,270,000134,936,0002,117,632
9Sep 12, 2026 07:5932,728277,100,963133,045,000135,327,0002,117,632