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:44Victor MerckléVictor MerckléScore: 5,364Success
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:452,72830,761,86521,283,0001,090,0002,117,632stderr
2Aug 23, 2026 18:452,75030,898,50221,474,0001,081,0002,117,632stderr
3Aug 23, 2026 18:452,75331,575,44321,488,0001,094,0002,117,632stderr
4Aug 23, 2026 18:452,76231,012,07721,626,0001,030,0002,117,632stderr
5Aug 23, 2026 18:455,36452,322,63242,941,0001,045,0002,117,632stderr
6Aug 23, 2026 18:455,38752,522,05143,087,0001,091,0002,117,632stderr
7Aug 23, 2026 18:455,39452,563,21143,174,0001,063,0002,117,632stderr
8Aug 23, 2026 18:455,41652,735,64043,275,0001,141,0002,117,632stderr
9Aug 23, 2026 18:455,42852,891,37143,448,0001,064,0002,117,632stderr