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 29, 2026 09:01Victor MerckléVictor MerckléScore: 2,869Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 29, 2026 09:042,83931,670,39122,225,0001,061,0002,117,632stderr
2Aug 29, 2026 09:042,85931,835,46822,390,0001,056,0002,117,632stderr
3Aug 29, 2026 09:042,86531,865,05722,456,0001,045,0002,117,632stderr
4Aug 29, 2026 09:042,86731,853,66322,456,0001,058,0002,117,632stderr
5Aug 29, 2026 09:042,86931,882,06322,466,0001,064,0002,117,632stderr
6Aug 29, 2026 09:042,87431,926,49522,527,0001,047,0002,117,632stderr
7Aug 29, 2026 09:042,89032,054,08122,626,0001,078,0002,117,632stderr
8Aug 29, 2026 09:045,45653,068,19343,702,0001,038,0002,117,632stderr
9Aug 29, 2026 09:045,48953,466,11343,986,0001,029,0002,117,632stderr