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 13:55Victor MerckléVictor MerckléScore: 5,383Success
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 13:572,74130,777,57121,469,0001,012,0002,117,632stderr
2Aug 29, 2026 13:572,75430,758,97321,559,0001,026,0002,117,632stderr
3Aug 29, 2026 13:575,35752,231,52742,899,0001,030,0002,117,632stderr
4Aug 29, 2026 13:575,38052,407,38343,081,0001,035,0002,117,632stderr
5Aug 29, 2026 13:575,38352,300,52943,077,0001,067,0002,117,632stderr
6Aug 29, 2026 13:575,40752,606,50743,204,0001,137,0002,117,632stderr
7Aug 29, 2026 13:575,40852,688,32443,315,0001,036,0002,117,632stderr
8Aug 29, 2026 13:575,47453,004,33143,694,0001,193,0002,117,632stderr
9Aug 29, 2026 13:575,49754,707,68443,778,0001,304,0002,117,632stderr