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:23Victor 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:242,85231,351,12722,264,0001,127,0002,117,632stderr
2Jul 4, 2026 05:242,87631,549,06522,554,0001,036,0002,117,632stderr
3Jul 4, 2026 05:242,89131,661,53522,668,0001,040,0002,117,632stderr
4Jul 4, 2026 05:242,89431,650,71622,613,0001,122,0002,117,632stderr
5Jul 4, 2026 05:242,92231,982,56922,949,0001,017,0002,117,632stderr
6Jul 4, 2026 05:2411,683105,113,99294,600,0001,205,0002,117,632stderr
7Jul 4, 2026 05:2411,698103,822,27694,798,0001,129,0002,117,632stderr
8Jul 4, 2026 05:2411,710104,366,63294,870,0001,156,0002,117,632stderr
9Jul 4, 2026 05:2412,221108,127,10199,196,0001,019,0002,117,632stderr