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 17:12Victor MerckléVictor MerckléScore: 4,442Success
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 17:144,31595,858,80533,170,0002,216,0002,117,632stderr
2Aug 23, 2026 17:144,35096,526,02233,527,0002,147,0002,117,632stderr
3Aug 23, 2026 17:144,39396,390,40133,849,0002,175,0002,117,632stderr
4Aug 23, 2026 17:144,41997,994,80934,163,0002,078,0002,117,632stderr
5Aug 23, 2026 17:144,44297,731,93834,166,0002,266,0002,117,632stderr
6Aug 23, 2026 17:147,018117,975,73055,371,0002,183,0002,117,632stderr
7Aug 23, 2026 17:147,023117,979,67455,452,0002,139,0002,117,632stderr
8Aug 23, 2026 17:147,069118,494,47855,790,0002,183,0002,117,632stderr
9Aug 23, 2026 17:147,110118,761,89956,090,0002,216,0002,117,632stderr