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 listJul 7, 2026 10:20Victor MerckléVictor MerckléScore: 12,089Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 7, 2026 10:213,19834,133,54725,216,0001,015,0002,117,632stderr
2Jul 7, 2026 10:213,22234,325,28725,324,0001,103,0002,117,632stderr
3Jul 7, 2026 10:213,24034,544,07325,557,0001,013,0002,117,632stderr
4Jul 7, 2026 10:213,27736,454,83825,777,0001,096,0002,117,632stderr
5Jul 7, 2026 10:2112,089107,054,01298,082,0001,053,0002,117,632stderr
6Jul 7, 2026 10:2112,182107,825,00098,829,0001,065,0002,117,632stderr
7Jul 7, 2026 10:2112,220108,258,32199,167,0001,038,0002,117,632stderr
8Jul 7, 2026 10:2112,234108,185,34799,303,0001,018,0002,117,632stderr
9Jul 7, 2026 10:2112,676111,917,347102,777,0001,174,0002,117,632stderr