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 listAug 23, 2026 18:04Victor MerckléVictor MerckléScore: 5,416Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 23, 2026 18:052,76731,057,04521,593,0001,097,0002,117,632stderr
2Aug 23, 2026 18:052,80231,419,53121,842,0001,135,0002,117,632stderr
3Aug 23, 2026 18:052,92832,348,51022,743,0001,270,0002,117,632stderr
4Aug 23, 2026 18:055,41052,665,07243,337,0001,031,0002,117,632stderr
5Aug 23, 2026 18:055,41652,808,63443,366,0001,052,0002,117,632stderr
6Aug 23, 2026 18:055,42452,807,96443,419,0001,058,0002,117,632stderr
7Aug 23, 2026 18:055,45953,822,90243,581,0001,187,0002,117,632stderr
8Aug 23, 2026 18:055,48853,433,54743,858,0001,144,0002,117,632stderr
9Aug 23, 2026 18:055,48953,364,06843,950,0001,064,0002,117,632stderr