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 listSep 1, 2026 11:15Victor MerckléVictor MerckléScore: 2,750Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 1, 2026 11:162,73530,806,50321,289,0001,140,0002,117,632stderr
2Sep 1, 2026 11:162,73730,827,08921,319,0001,129,0002,117,632stderr
3Sep 1, 2026 11:162,74230,814,92121,358,0001,128,0002,117,632stderr
4Sep 1, 2026 11:162,74630,806,84921,407,0001,118,0002,117,632stderr
5Sep 1, 2026 11:162,75030,961,40921,463,0001,090,0002,117,632stderr
6Sep 1, 2026 11:162,75331,767,60321,499,0001,079,0002,117,632stderr
7Sep 1, 2026 11:162,76031,094,05421,561,0001,074,0002,117,632stderr
8Sep 1, 2026 11:165,39152,572,26442,993,0001,216,0002,117,632stderr
9Sep 1, 2026 11:165,41952,760,71743,422,0001,016,0002,117,632stderr