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:28Victor MerckléVictor MerckléScore: 2,952Success
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:292,88631,645,31822,521,0001,151,0002,117,632stderr
2Jul 4, 2026 05:292,91031,805,61122,837,0001,025,0002,117,632stderr
3Jul 4, 2026 05:292,93532,013,34922,888,0001,183,0002,117,632stderr
4Jul 4, 2026 05:292,93631,984,09323,059,0001,022,0002,117,632stderr
5Jul 4, 2026 05:292,95232,125,41623,168,0001,039,0002,117,632stderr
6Jul 4, 2026 05:2911,656103,580,61894,510,0001,070,0002,117,632stderr
7Jul 4, 2026 05:2911,699103,874,15694,813,0001,122,0002,117,632stderr
8Jul 4, 2026 05:2911,713104,327,56394,887,0001,161,0002,117,632stderr
9Jul 4, 2026 05:2912,358109,339,311100,201,0001,142,0002,117,632stderr