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:47Victor MerckléVictor MerckléScore: 2,819Success
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:492,72630,517,39221,272,0001,084,0002,117,632stderr
2Aug 29, 2026 13:492,73430,619,20121,243,0001,176,0002,117,632stderr
3Aug 29, 2026 13:492,74230,899,19821,462,0001,028,0002,117,632stderr
4Aug 29, 2026 13:492,76231,014,69621,634,0001,018,0002,117,632stderr
5Aug 29, 2026 13:492,81931,223,36822,008,0001,115,0002,117,632stderr
6Aug 29, 2026 13:493,15542,324,29624,785,0001,088,0002,117,632stderr
7Aug 29, 2026 13:495,40852,495,63443,212,0001,139,0002,117,632stderr
8Aug 29, 2026 13:495,41752,801,27643,305,0001,118,0002,117,632stderr
9Aug 29, 2026 13:495,43552,892,63043,441,0001,126,0002,117,632stderr