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 listJul 4, 2026 05:33Victor MerckléVictor MerckléScore: 2,922Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 4, 2026 05:342,84831,705,56122,313,0001,043,0002,117,632stderr
2Jul 4, 2026 05:342,89031,957,28822,650,0001,048,0002,117,632stderr
3Jul 4, 2026 05:342,90931,866,16122,832,0001,026,0002,117,632stderr
4Jul 4, 2026 05:342,91131,772,57822,748,0001,124,0002,117,632stderr
5Jul 4, 2026 05:342,92231,962,77122,930,0001,038,0002,117,632stderr
6Jul 4, 2026 05:3411,615103,174,76394,224,0001,023,0002,117,632stderr
7Jul 4, 2026 05:3411,704104,765,61894,887,0001,088,0002,117,632stderr
8Jul 4, 2026 05:3411,736104,254,91495,233,0001,007,0002,117,632stderr
9Jul 4, 2026 05:3412,039106,665,09797,714,0001,008,0002,117,632stderr