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 7, 2026 11:34Victor MerckléVictor MerckléScore: 2,894Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 7, 2026 11:352,85431,535,68822,392,0001,018,0002,117,632stderr
2Jul 7, 2026 11:352,86131,480,96522,346,0001,122,0002,117,632stderr
3Jul 7, 2026 11:352,88231,607,43322,520,0001,117,0002,117,632stderr
4Jul 7, 2026 11:352,88331,619,68322,619,0001,029,0002,117,632stderr
5Jul 7, 2026 11:352,89432,091,95722,715,0001,020,0002,117,632stderr
6Jul 7, 2026 11:352,89831,760,38022,737,0001,034,0002,117,632stderr
7Jul 7, 2026 11:3511,700104,295,61794,807,0001,134,0002,117,632stderr
8Jul 7, 2026 11:3511,747104,388,60195,204,0001,123,0002,117,632stderr
9Jul 7, 2026 11:3511,808104,826,13295,750,0001,078,0002,117,632stderr