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 12:26Victor MerckléVictor MerckléScore: 2,757Success
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 12:292,72730,680,91921,288,0001,079,0002,117,632stderr
2Aug 29, 2026 12:292,72930,708,08621,286,0001,099,0002,117,632stderr
3Aug 29, 2026 12:292,73530,560,21021,297,0001,136,0002,117,632stderr
4Aug 29, 2026 12:292,73730,890,37821,438,0001,010,0002,117,632stderr
5Aug 29, 2026 12:292,75730,967,39721,605,0001,009,0002,117,632stderr
6Aug 29, 2026 12:292,76131,606,42221,616,0001,025,0002,117,632stderr
7Aug 29, 2026 12:295,41952,568,87743,290,0001,146,0002,117,632stderr
8Aug 29, 2026 12:295,43053,504,20543,387,0001,141,0002,117,632stderr
9Aug 29, 2026 12:295,45653,145,47843,532,0001,209,0002,117,632stderr