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 19:27Andrew EpsteinAndrew EpsteinScore: 15,980Success
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 19:2915,507137,616,532125,983,0001,179,0002,117,632stderr
2Sep 19, 2026 19:2915,712139,221,306127,673,0001,172,0002,117,632stderr
3Sep 19, 2026 19:2915,740139,457,247127,945,0001,123,0002,117,632stderr
4Sep 19, 2026 19:2915,813140,131,508128,521,0001,150,0002,117,632stderr
5Sep 19, 2026 19:2915,980142,649,858129,921,0001,116,0002,117,632stderr
6Sep 19, 2026 19:2916,102142,402,869130,901,0001,138,0002,117,632stderr
7Sep 19, 2026 19:2916,670147,170,140135,513,0001,185,0002,117,632stderr
8Sep 19, 2026 19:2916,700148,011,162135,785,0001,156,0002,117,632stderr
9Sep 19, 2026 19:2916,913149,485,991137,493,0001,201,0002,117,632stderr