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 19, 2026 13:23Andrew EpsteinAndrew EpsteinScore: 161,307Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 19, 2026 13:25161,1581,331,878,5691,318,493,0003,004,0002,125,824stderr
2Sep 19, 2026 13:25161,1701,331,967,5521,318,592,0003,002,00032,768stderr
3Sep 19, 2026 13:25161,2171,332,323,4821,318,980,0003,002,00032,768stderr
4Sep 19, 2026 13:25161,2321,332,438,5931,319,101,0003,005,0002,125,824stderr
5Sep 19, 2026 13:25161,3071,333,042,4201,319,718,0003,004,0002,125,824stderr
6Sep 19, 2026 13:25161,3891,333,816,9511,320,391,0003,003,0002,125,824stderr
7Sep 19, 2026 13:25161,4181,333,938,0541,320,625,0003,007,0002,125,824stderr
8Sep 19, 2026 13:25161,4531,334,277,9061,320,763,0003,152,0002,125,824stderr
9Sep 19, 2026 13:25161,5521,335,028,7781,320,708,0004,023,0002,125,824stderr